Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

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

by LanX (Archbishop)
on Oct 30, 2010 at 12:43 UTC ( #868462=note: print w/replies, xml ) Need Help??


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

Traditionally, a path referred to what is now usually known as an open walk. Nowadays, when stated without any qualification, a path is usually understood to be simple, meaning that no vertices (and thus no edges) are repeated.

:)

I'm not sure if the OP is aware about this distinction, the examples given suggest he talks about non repeated walks.

Cheers Rolf

  • Comment on Re^2: 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://868462]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (6)
As of 2020-03-30 18:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    To "Disagree to disagree" means to:









    Results (175 votes). Check out past polls.

    Notices?