{"version":"1.0","type":"link","title":"Seidel's algorithm - Newikis","description":"Seidel's algorithm is an algorithm designed by Raimund Seidel in 1992 for the all-pairs-shortest-path problem for undirected, unweighted, connected graphs. It solves the problem in expected time for a graph with vertices, where is the exponent in the complexity of matrix multiplication. If only the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}