I have a problem where I need to find all possible paths in a space. <BR><BR>For example, I have some number of vectors connected by some number of lines (edges). If I start at vector A and my target ...

* 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. A quick Google search suggests a ...