dominatorTree              package:RBGL              R Documentation

_C_o_m_p_u_t_e _d_o_m_i_n_a_t_o_r _t_r_e_e _f_r_o_m _a _v_e_r_t_e_x _i_n _a _d_i_r_e_c_t_e_d _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Compute dominator tree from a vertex in a directed graph

_U_s_a_g_e:

     dominatorTree(g, start=nodes(g)[1])

_A_r_g_u_m_e_n_t_s:

       g: a directed graph, one instance of the 'graph' class 

   start: a vertex in graph 'g' 

_D_e_t_a_i_l_s:

     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.

_V_a_l_u_e:

     Output is a vector, giving each node its immediate dominator.

_A_u_t_h_o_r(_s):

     Li Long <li.long@isb-sib.ch>

_R_e_f_e_r_e_n_c_e_s:

     Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

_E_x_a_m_p_l_e_s:

     con1 <- file(system.file("XML/dominator.gxl",package="RBGL"), open="r")
     g1 <- fromGXL(con1)
     close(con1)

     dominatorTree(g1)

