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

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

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.

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 ...