This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

▼CBaseGraph
▼Cminlca::utils::CliqueSet< BaseGraph >	Class describing a set of non-adjacent cliques
Cminlca::utils::CliqueCycle< BaseGraph >	Class describing a cycle of cliques
▼Cminlca::utils::RandomGraph< CliqueSet< BaseGraph > >
Cminlca::utils::CliqueGraph< BaseGraph >	Class describing a random graph with cliques
▼Cminlca::utils::RandomGraph< BaseGraph >
Cminlca::utils::BinomialRandom< BaseGraph >	Class defining binomial random graphs
Cminlca::utils::RandomGeometric< BaseGraph >	Class defining random geometric graphs
Cminlca::utils::RandomOuterplanar< BaseGraph >	Class defining random geometric graphs
▼CBfsVisitor
Cminlca::MinLCAGreedyBfs< Greedy, Graph >	Class for greedy algorithms using a breadth-first search
Cminlca::MinLCAVertexOrderSA< Greedy, Graph >	Class defining a local search approach doing greedy recolourings
▼Cminlca::MinLCAGreedyBfs< MinLCAGreedyLp, Graph >
Cminlca::MinLCAGreedyLpBfs< Graph >	Use the MinLCAGreedyLp with Bfs
▼CGreedy
Cminlca::MinLCAGreedyBfs< Greedy, Graph >	Class for greedy algorithms using a breadth-first search
Cminlca::MinLCAVertexOrderSA< Greedy, Graph >::GreedyNodeSA	Class defining the node for the simulated annealing search changing the colours
▼CLCAOpt
▼Cminlca::MinLCAProfiler< LCAOpt >
Cminlca::MinLCAOptProfiler< LCAOpt >	Class for timing MinLCA optimisation algorithms
▼CLpBase
▼Clemon::GrbBase	Base interface for the Gurobi LP and MIP solver
Clemon::GrbLp	Interface for the Gurobi LP solver
Clemon::GrbMip	Interface for the Gurobi MIP solver
▼CLpSolver
Clemon::GrbLp	Interface for the Gurobi LP solver
▼Cminlca::MinLCA< Graph >	Base class for MinLCA algorithms
Cminlca::MinLCAColoursSA< Graph >::NodeSA	Class defining the node for the simulated annealing search changing the colours
▼Cminlca::MinLCAGreedy< Graph >	Base class for greedy algorithms
Cminlca::MinLCAGreedyLeastCost< Graph >	Greedy nearest colour approach for MinLCA
▼Cminlca::MinLCAGreedyLp< Graph >	Use the relaxed linear model as a base for colour preferences
Cminlca::MinLCAGreedyBfs< MinLCAGreedyLp, Graph >
Cminlca::MinLCAGreedyNearest< Graph >	Greedy nearest colour approach for MinLCA
Cminlca::MinLCAGreedyNearestRnd< Graph >	Randomised greedy nearest colour approach for MinLCA
▼Cminlca::MinLCAOpt< Graph >	Base class for defining optimisation MinLCA algorithms
Cminlca::MinLCAColoursSA< Graph >	Class defining a local search approach changing the colours
Cminlca::MinLCAOptMip< Graph >	Class defining a relaxed linear programming model and algorithm for MinLCA
Cminlca::MinLCAVertexOrderSA< Greedy, Graph >	Class defining a local search approach doing greedy recolourings
Cminlca::MinLCALpModel< Graph >	Class defining a relaxed linear programming model for MinLCA
▼CMipSolver
Clemon::GrbMip	Interface for the Gurobi MIP solver
Cminlca::utils::SimulatedAnnealing< Node >	Generic simulated annealing algorithm
Cminlca::utils::SimulatedAnnealing< minlca::MinLCAColoursSA::NodeSA >
Cminlca::utils::SimulatedAnnealing< minlca::MinLCAVertexOrderSA::GreedyNodeSA >
Cminlca::utils::Timer	Simple timing class
▼CGraph
Cminlca::utils::RandomGraph< Graph >	Base class for random graph generators
▼CLCA
Cminlca::MinLCAProfiler< LCA >	Class for timing MinLCA algorithms