Do you know where your variables are?  
PerlMonks 
comment on 
( [id://3333] : superdoc . print w/replies, xml )  Need Help?? 
lidden,
Unfortunately it won't  at least, not as I understand it. In the problem posed by neversaint, all paths between two nodes is desired. It is never said that cycle avoidance is required but I have assumed it for my purposes. In other words, each node visited along the path may only be visited once. Any algorithm designed to find the shortest or cheapest path or paths will not produce the correct result  even if every edge has the same cost. Assume the two nodes are directly connected. Imagine taking a Hamiltonian path around the graph with the start and end points being the two nodes in question  this can certainly be proven not to be among the shortest/cheapest paths. Cheers  L~R In reply to Re^2: Short Circuiting DFS Graph Traversal
by Limbic~Region

Log In^{?}
Chatterbox^{?}
Other Users^{?}
Others exploiting the Monastery: (6)
As of 20240220 22:53 GMT
Sections^{?}
Information^{?}
Find Nodes^{?}
Leftovers^{?}
Voting Booth^{?}
My favourite way to spend a leap day ...
Results (21 votes). Check out past polls. 