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)

