All-Pairs Shortest Paths
All-Pairs Shortest Paths. Problem Given a graph G = ( V , E ), where every edge e has weight w ( e ), find, for every pair of vertices u , v in V , a shortest path from u to v. Input: an adjacency matrix. Output in tabular form : the entry in u ’s row and v ’s
499 views • 17 slides