Using Dijkstra’s Algorithm to Find All Shortest Paths in a Graph
I always had trouble spelling Dijkstra correctly until someone pointed out “It’s just D, followed by i-j-k, then stra”. Once it was pointed out that i-j-k is represented sequentially in alphabetical order, spelling Dijkstra becomes trival - almos...
[...Read more...]