Re: find all directed paths between a source and destination

In article <ba2d5990-d172-4bcf-8d86-99d601778ac4@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Ginu <osheikh81@xxxxxxxxx> wrote:
Hello all. I have a graph (that is not necessarily directed) of a
number of nodes. I'm trying to enumerate through all directed paths
between source and destination (to avoid routing loops). There
shouldn't be an infinite number of solutions to this problem because
nodes cannot be traversed more than once in the solution. Has anybody
come across a solution for this? Thanks in advance.

Try asking Google about "k shortest paths Yen". Strictly speaking this is
not exactly what you asked for but it's very close.
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
.

Relevant Pages