Dijkstra the short and greedy!

Dijkstra’s algorithm is one of many algorithm to find the shortest path from a source node to all other nodes on a graph. While it is not the fastest algorithm out there, it is one of the most documented and easiest to implement. It behaves like the breadth-first search algorithm in that it expands its […]