Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which as conceived by Edsger W. Dijkstra in 1956. The original version of the algorithm found the shortest path between two nodes, but the more common version found the shortest paths between a "source" node and all other nodes of… Continue reading Why did Dijkstra cross the road? Cuz it was the shortest path!