Aleph::Greedy_Coloring< GT, SA > Class Template Reference

Functor wrapper for greedy_coloring. More...

#include <Graph_Coloring.H>

Public Member Functions
size_t	operator() (const GT &g, DynMapTree< typename GT::Node *, size_t > &colors) const
	Execute greedy coloring.

Detailed Description

template<class GT, class SA = Dft_Show_Arc<GT>>
class Aleph::Greedy_Coloring< GT, SA >

Functor wrapper for greedy_coloring.

Provided for use with higher-order graph utilities that accept coloring algorithms as template parameters. Forwards directly to greedy_coloring; see that function for full semantics, complexity, and thread-safety notes.

Template Parameters

GT	Graph type.
SA	Arc-filter functor (defaults to Dft_Show_Arc<GT>).

Definition at line 632 of file Graph_Coloring.H.

Member Function Documentation

operator()()

template<class GT , class SA = Dft_Show_Arc<GT>>

size_t Aleph::Greedy_Coloring< GT, SA >::operator() ( const GT &  g, DynMapTree< typename GT::Node *, size_t > &  colors  ) const

inline

Execute greedy coloring.

Parameters

[in]	g	Input graph (no self-loops).
[out]	colors	Output node→color map (overwritten).

Returns

Number of distinct colors used.

Exceptions

std::domain_error

if g contains a self-loop.

Definition at line 641 of file Graph_Coloring.H.

References Aleph::divide_and_conquer_partition_dp().

---

The documentation for this class was generated from the following file:

• Graph_Coloring.H