Find all possible path between two nodes in a undirected graph

Posted by manoj on Stack Overflow See other posts from Stack Overflow or by manoj
Published on 2010-05-21T01:36:39Z Indexed on 2010/05/21 1:40 UTC
Read the original article Hit count: 591

Filed under:

Can anybody give me a C Code to find all possible paths between two nodes? eg. if the graph has following edges 1-2 1-3 2-3 2-4 3-4

all paths between 1 and 4 are:

1-2-3-4

1-2-4

1-3-4

1-3-2-4

Developer IT