
6 Jul
2007
6 Jul
'07
8:01 p.m.
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