Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proven that it’s “universally optimal.”Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proven that it’s “universally optimal.”
Scientists Establish the Best Algorithm for Traversing a Map from Wired Ben Brubaker
