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.

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

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

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...

In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms Treesort-Dijkstra's for a certain class of networks ...