All possible paths in a cyclic undirected graph
Posted
by Elias
on Stack Overflow
See other posts from Stack Overflow
or by Elias
Published on 2010-06-17T05:02:32Z
Indexed on
2010/06/18
0:03 UTC
Read the original article
Hit count: 243
I'm trying to develop an algorithm that identifies all possible paths between two nodes in a graph, as in this example.
in fact, i just need to know which nodes appear in all existing paths.
in the web only got references about DFS, A* or dijkstra, but i think they doesn't work in this case.
Does anyone know how to solve it?
© Stack Overflow or respective owner