Re: [Boost-users] [Graph] I could not get the reversed graph!

Thanks, Doug,

For example, you can call: lengauer_tarjan_dominator_tree(make_reverse_graph(graph), exit_node, dominators)

make_reverse_graph(graph) does not give me the G type (defined in the following code), so I could not use it in this way. This is the reason I use the following code which does not work. typedef adjacency_list< listS, listS, bidirectionalS, property<vertex_index_t, std::size_t>, no_property> G; typedef reverse_graph<G, G&> ReverseG; ReverseG g2=boost::make_reverse_graph(g); ... lengauer_tarjan_dominator_tree(g2.m_g, vertex(0, g), domTreePredMap); Jiangfan