...one of the most highly
regarded and expertly designed C++ library projects in the
world.

— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards

Graphs: |
undirected, loop-free |
---|---|

Properties: |
color |

Complexity: |
time: O(|E| |V|) |

template <class Graph, class ColorMap> typename boost::property_traits::value_type edge_coloring(const Graph &g, ColorMap color);

Computes an edge coloring for the vertices in the graph, using
an algorithm proposed by Misra et al. []. Given edges ordered
e_{1}, e_{2}, ..., e_{n} it assignes a
colors c_{1}, c_{2}, ..., c_{n} in a way
that no vertex connects with 2 edges of the same color. Furthermore
at most m + 1 colors are used.

The graph object on which the algorithm will be applied. The typeOUT:Graphmust be a model of Edge List Graph and Incidence Graph.

This property map records the colors of each edges. It must be a model of Read/Write Property Map whose key type is the same as the edge descriptor type of the graph and whose value type is an integral type that can store all values smaller or equal to m.

Copyright © 2013 | Maciej Piechotka (uzytkownik2@gmail.com) |