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?

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.