Dijkstra's Algorithm Floyd-Warshall Algorithm Warshall's Algorithm Graph Eccentricity Prim's Algorithm Kruskal's Algorithm Depth-First Search (DFS) Note: Breadth-First Search (BFS) was intended but ...

Provided that all of the vertices are reachable from the source vertex; Dijkstra’s algorithm can be used to find the shortest distance from the source vertex to all other vertices in a weighted graph.