Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Finding All Paths From a Graph From a Given Source and End Node

by jethro (Monsignor)
on Oct 28, 2010 at 14:34 UTC ( #868041=note: print w/replies, xml ) Need Help??


in reply to Finding All Paths From a Graph From a Given Source and End Node

Exhaustive search. Just try out every vertice recursively and disregard any vertices that you already have in your path. If you want all paths and not only the shortest or anything I don't see much possibility for a shortcut

You can speed this up a bit if you change the recursive function to an interative, but basically you just simulate the recursion then.

UPDATE: See Limpic-Regions post for the truth about shortcuts

  • Comment on Re: Finding All Paths From a Graph From a Given Source and End Node

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://868041]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2020-04-05 01:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The most amusing oxymoron is:
















    Results (33 votes). Check out past polls.

    Notices?