Graph algorithms
Shortest path problem Dijkstra’s algorithm fixes a single node as the “source” node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. Wiki Dijkstra’s algorithm Complexity analysis Wiki On stack overflow: Why does Dijkstra’s algorithm use decrease-key? Actually Implementing Dijkstra’s Algorithm - complexity analysis considering three components of the main loop: time per insert, extract_min, and change_priority operation: O(nT_ins + nT_min + m*T_change)...