bandwidth                package:RBGL                R Documentation

_C_o_m_p_u_t_e _b_a_n_d_w_i_d_t_h _f_o_r _a_n _u_n_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 bandwidth for an undirected graph

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

     bandwidth(g)

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

       g: an instance of the 'graph' class with 'edgemode' "undirected"

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

     The bandwidth of an undirected graph G=(V, E) is the maximum
     distance between  two adjacent vertices, with distance measured on
     a line upon which the vertices  have been placed at unit
     intervals. To put it another way, if the vertices of  an
     undirected graph G=(V,E) are each assigned an index from zero to
     |V| - 1  given by index[v], then the bandwidth of G is

     B(G) = max { |index[u] - index[v]|  | (u,v) in E }

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

bandwidth: the bandwidth of the given graph

_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:

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

     coex <- fromGXL(file(system.file("XML/dijkex.gxl",package="RBGL")))
     coex@edgemode <- "undirected"
     bandwidth(coex)

