Hi Guys, I am just playing with dijkstra algorithm in C# and got it working good but now I want to modify it to get all the possible paths from the start and target nodes. Any advise?

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

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.