closest.transitive.greedy        package:nem        R Documentation

_F_i_n_d _t_r_a_n_s_i_t_i_v_e_l_y _c_l_o_s_e_d _g_r_a_p_h _m_o_s_t _s_i_m_i_l_a_r _t_o _t_h_e _g_i_v_e_n _o_n_e

_D_e_s_c_r_i_p_t_i_o_n:

     First, from the original graph Phi spurious edges are pruned via
     'prune.graph'. Then the new graph Phi' is transitively closed.
     Afterwards, the algorithms successively introduces new edges
     minimizing the distance to the original graph (defined as sum_{ij}
     |Phi_{ij} - Phi'_{ij}|) most. After each edge addition the graph
     is transitively closed again.

_U_s_a_g_e:

     closest.transitive.greedy(Phi, verbose=TRUE)

_A_r_g_u_m_e_n_t_s:

     Phi: adjacency matrix

 verbose: do you want to see progress statements printed or not?
          Default: TRUE

_V_a_l_u_e:

     adjacency matrix

_A_u_t_h_o_r(_s):

     Holger Froehlich

_S_e_e _A_l_s_o:

     'prune.graph, \code{transitive.closure},
     \code{transitive.reduction}'

