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

In Section Seekers of Perl Wisdom