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.

Sometimes, wrapping your head around mathematical concepts can be tricky without a visual aid. Thankfully we have makers like Russell Eveleigh out there who are busy making beautiful Raspberry ...