Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
graphs, nodes, paths
2 views
Skip to first unread message
ludaekipa
Apr 21, 2004, 7:00:01 AM4/21/04
to
I have a DAG, some sources, and some leafs. Given m nodes of a graph, I have
to find all the possible paths passing through all of the m nodes. So if
m=2, and I select node7 and node9, I want to find all the paths so that
every path pass through both node7 and node9.
So if anyone know some alghorithm to do so, his help will be appreciated
thnx
to find all the possible paths passing through all of the m nodes. So if
m=2, and I select node7 and node9, I want to find all the paths so that
every path pass through both node7 and node9.
So if anyone know some alghorithm to do so, his help will be appreciated
thnx
0 new messages