MinLCA algorithms
|
Definitions for simulated annealing using greedy recolourings. More...
#include <vector>
#include <minlca/base.hh>
#include <utils/simulated-annealing.hh>
#include <lemon/bfs.h>
#include <lemon/connectivity.h>
Go to the source code of this file.
Classes | |
class | minlca::MinLCAVertexOrderSA< Greedy, Graph > |
Class defining a local search approach doing greedy recolourings. More... | |
class | minlca::MinLCAVertexOrderSA< Greedy, Graph >::GreedyNodeSA |
Class defining the node for the simulated annealing search changing the colours. More... | |
Namespaces | |
minlca | |
Default namespace Default namespace for MinLCA algorithms. | |
Definitions for simulated annealing using greedy recolourings.
Definition in file optimisation-sa-greedy.hh.