degree_coloring.hpp File Reference

Boost-based implementation of a heuristic sequential coloring algorithm based on the descandant degree ordering of vertices. More...

#include <boost/config.hpp>
#include <boost/graph/properties.hpp>
#include <boost/version.hpp>
#include <boost/property_map.hpp>
#include "custom_set.hpp"
#include <algorithm>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/limits.hpp>
#include <boost/tuple/tuple.hpp>
#include <vector>

Include dependency graph for degree_coloring.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	boost::degree_compare_functor< VertexListGraph >
	degree compare functor More...

Namespaces
	boost
	This algorithm is to find coloring of a graph Algorithm: Let G = (V,E) be a graph with vertices v_1, v_2, ..., v_n.

Functions
template<class VertexListGraph , class ColorMap >
property_traits< ColorMap >::value_type	boost::degree_coloring (const VertexListGraph &G, ColorMap color)
	coloring of a graph following the descandant degree of vertices More...

Detailed Description

Boost-based implementation of a heuristic sequential coloring algorithm based on the descandant degree ordering of vertices.

Simple sequential coloring heuristic based on descandant degree coloring.

Author

Fabrizio Ferrandi fabri.nosp@m.zio..nosp@m.ferra.nosp@m.ndi@.nosp@m.polim.nosp@m.i.it $Revision$ $Date$ Last modified by $Author$

Definition in file degree_coloring.hpp.