floyd.warshall.all.pairs.sp       package:RBGL       R Documentation

_c_o_m_p_u_t_e _s_h_o_r_t_e_s_t _p_a_t_h_s _f_o_r _a_l_l _p_a_i_r_s _o_f _n_o_d_e_s

_D_e_s_c_r_i_p_t_i_o_n:

     compute shortest paths for all pairs of nodes

_U_s_a_g_e:

     floyd.warshall.all.pairs.sp(g)

_A_r_g_u_m_e_n_t_s:

       g: graph object with edge weights given

_D_e_t_a_i_l_s:

     Compute shortest paths between every pair of vertices for a dense
     graph.  

     The result is given as a distance matrix.

     For a sparse matrix, use 'johnson.all.pairs.sp' instead.

     See documentation on these algorithms in Boost Graph Library for
     more details.

_V_a_l_u_e:

     matrix of shortest path lengths, read from row node to col node

_N_o_t_e:

_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 by Siek et al.

_S_e_e _A_l_s_o:

     'johnson.all.pairs.sp'

_E_x_a_m_p_l_e_s:

     coex <- fromGXL(file(system.file("XML/conn.gxl", package="RBGL"), open="r"))
     floyd.warshall.all.pairs.sp(coex)

