Compute dominator tree from a vertex in a directed graph
Compute dominator tree from a vertex in a directed graph
dominatorTree(g, start=nodes(g)[1]) lengauerTarjanDominatorTree(g, start=nodes(g)[1])
g |
a directed graph, one instance of the |
start |
a vertex in graph |
As stated in documentation on Lengauer Tarjan dominator tree in Boost Graph Library:
A vertex u dominates a vertex v, if every path of directed graph from the entry to v must go through u.
This function builds the dominator tree for a directed graph.
Output is a vector, giving each node its immediate dominator.
Li Long <li.long@isb-sib.ch>
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
con1 <- file(system.file("XML/dominator.gxl",package="RBGL"), open="r")
g1 <- fromGXL(con1)
close(con1)
dominatorTree(g1)
lengauerTarjanDominatorTree(g1)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.