Well, if I remember my graph theory well enough, if A is the adjacency matrix of the graph, each entry of A^n is the number of ways to get between the corresponding nodes in n steps or less. So ...

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?