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

What's the fastest way to implement that in Perl?

Considering your graph has a loop (A -> B, B -> A), and your start point lies on this loop, there's no fastest way. In fact, any program that terminates will not be correct, as there are an infinite numbers of paths from B to E.

Comment on Re: Finding All Paths From a Graph From a Given Source and End Node Select or Download Code

Replies are listed 'Best First'.
Re^2: Finding All Paths From a Graph From a Given Source and End Node by LanX (Saint) on Oct 30, 2010 at 12:43 UTC
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	[reply]