1 #ifndef __MINLCA_MINLCA_OPT_HH
2 #define __MINLCA_MINLCA_OPT_HH
7 #include <lemon/core.h>
8 #include <lemon/smart_graph.h>
23 template<
typename Graph = lemon::SmartGraph>
MinLCAStatus _s
The status of the solution.
MinLCAOpt(const Graph &g, int maxK=0)
Constructor for derived classes to use.
const Graph & _g
A const reference to the graph we want to arrange.
int _k
Largest index of the colours used.
virtual void initialSolution(const typename MinLCA< Graph >::Colouring &c)=0
Set the initial solution for the algorithm.
Colouring _c
The vertex colouring.
Default namespace Default namespace for MinLCA algorithms.
Defines the base class for MinLCA algorithms.
Functions for reading graphs and getting graph properties.
int _max_k
Maximum number of colours allowed.
Base class for MinLCA algorithms.
Base class for defining optimisation MinLCA algorithms.
IntNodeMap Colouring
Type for graph colourings.
int maxK()
Maximum number of allowed colours.
long long _lca
Cost of the current solution.