Thanks Vladimir Prus, for your reply. Please guide me how i can use this method void transitive_closure(const Graph& g, GraphTC& tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map) *specially how i can declare and use * * "G_to_TC_VertexMap" & "* *VertexIndexMap"* Thanks Amanullah YASIN Master2 (ECD) Ecole Polytechnique Université de Nantes, France. Mob# 06 47 62 89 96 Fix # 02 72 00 26 45 amanyasin@gmail.com On Thu, Jun 4, 2009 at 5:01 PM, Vladimir Prus <vladimir@codesourcery.com>wrote:
Amanullah Yasin wrote:
Bonjour Dear
I want to check whether there is a directed path between two given nodes (A and C) using Boost graph.
If you want to do this once, for specific A and C, there's no need to use transitive_closure -- DFS will be fine.
I also want to access intermediate edges to examine PDAG properties.
The predecessor map returned by DFS will be handy for that.
I test
void transitive_closure(const Graph& g, GraphTC& tc) method. But i want to check between two given nodes.
Now i want to ask you
-
void transitive_closure(const Graph& g, GraphTC& tc,
G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map)
In the above method, how i can declare
G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map?
http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/transitive_closure.html
There's test case, you can check that.
- How i can examine the intermediate edges? or is there any other easy way?
This information is not returned by transitive_closure algorithm; I cannot immediately say if it can be modified to report that in any form.
- Volodya
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users