sequential.vertex.coloring       package:RBGL       R Documentation

_C_o_m_p_u_t_e _a _v_e_r_t_e_x _c_o_l_o_r_i_n_g _f_o_r _a _g_r_a_p_h

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

     Compute vertex coloring for a graph

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

     sequential.vertex.coloring(g)

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

       g: an instance of the 'graph' class

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

     A vertex coloring for a graph is to assign a color for each vertex
     so that no  two adjacent vertices are of the same color.  We
     designate the colors as  sequential integers: 1, 2, ....

     For ordered vertices, 'v1', 'v2', ..., 'vn', for k = 1, 2, ..., 
     n, this algorithm assigns 'vk' to the smallest possible color.  It
     does  NOT guarantee to use minimum number of colors.

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

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

no. of colors needed: how many colors to use to color the graph

colors of nodes: 

     { color label for each vertex }

_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"), open="r"))
     sequential.vertex.coloring(coex)

