Dijkstra's Algorithm

from blog Jonas Hietala, | ↗ original
For rust, I’m updating the documentation for the standard library and specifically with the collections. For the priority queue I had the idea to use Dijkstra’s algorithm as a fun example. That idea was well received and that example is now live. At first I wanted to use A* to solve the eight puzzle, which I’ve done before, but that example...