Floyd-Warshall algorithm

In computer science, the Floyd–Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted graph and also for finding transitive closure of a relation R. A single execution of the algorithm will find the lengths of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.

More at Wikipedia

Dijkstra's algorithm

Johnson's algorithm

More related topics