Dijkstra’s shortest path algorithm, Dijkstra’s Algorithm for Adjacency List Representation, Bellman–Ford Algorithm, Floyd Warshall Algorithm, Johnson’s algorithm for All-pairs shortest paths, Shortest Path in Directed Acyclic Graph,