The algorithm works by cycling through all possible pathways between two points. Once all of the potential routes have been measured, the shortest path can be identified.

* Why do you want to base this on Dijkstra's algorithm, which is designed to find a single shortest-path? Surely there are better options for your base implementation.

At the end of the algorithm, we run through all nodes of the shortest path (including s and t), and check their "multiple paths" flag. If none are found, the path is unique.

Classic math conundrum solved: Superb algorithm for finding the shortest route. ScienceDaily . Retrieved May 23, 2025 from www.sciencedaily.com / releases / 2021 / 03 / 210310204242.htm ...