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

quote:Originally posted by bouncingdaemon:quote:?? Difference between the two with respect to the wheel graph? My point was that HP won't take distances into account. As usual I expressed this ...

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.

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.