Dijkstra's Algorithm for Adjacency List Representation | Greedy Algo-8 - GeeksforGeeks
GitHub - 4hmedyasser/shortest-path-distance-calculator: Application implemented with C++ in which dijkstra algorithm used to compute the shortest path between any two inputs on a graph represented with adjacency list