The FPGA runs an algorithm for finding the shortest route between two points, called Dijkstra’s algorithm.

Project Scheduling in And-Or Graphs: A Generalization of Dijkstra's Algorithm George M. Adelson-Velsky and Eugene Levner Mathematics of Operations Research , pp. 504-517 (14 pages) ...

For decades, computer scientists working on negative-weight graphs tried to match the speed of Dijkstra’s algorithm with similar “combinatorial” algorithms. These involve discrete operations — like ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Ronald Boskovic, Paul Belcher, 83.03 A Teaching Note on Dijkstra's Shortest Path Algorithm, The Mathematical Gazette, Vol. 83, No. 497 (Jul., 1999), pp. 251-254 ...

Russell Eveleigh is using a Raspberry Pi Pico to demonstrate Dijkstra's algorithm visually with LEDs arranged as a map of the Cotswolds in England.