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.

Old Bound (Dijkstra): O (m+nlog⁡n)O (m+nlogn) New Bound: O (mlog⁡2/3n)O (mlog2/3n) For sparse graphs where mm is about O (n)O (n), this is asymptotically faster as nn grows. Practical & Theoretical ...