Compute a vertex coloring for a graph
Compute vertex coloring for a graph
sequential.vertex.coloring(g)
g |
an instance of the |
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.
no. of colors needed |
how many colors to use to color the graph |
colors of nodes |
color label for each vertex |
Li Long <li.long@isb-sib.ch>
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8
con <- file(system.file("XML/dijkex.gxl",package="RBGL"), open="r")
coex <- fromGXL(con)
close(con)
sequential.vertex.coloring(coex)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.