MinLCA algorithms
minlca::MinLCAVertexOrderSA< Greedy, Graph > Member List

This is the complete list of members for minlca::MinLCAVertexOrderSA< Greedy, Graph >, including all inherited members.

_cminlca::MinLCA< Graph >protected
_delete_randomminlca::MinLCAVertexOrderSA< Greedy, Graph >protected
_gminlca::MinLCA< Graph >protected
_kminlca::MinLCA< Graph >protected
_lcaminlca::MinLCA< Graph >protected
_max_kminlca::MinLCA< Graph >protected
_orderminlca::MinLCAVertexOrderSA< Greedy, Graph >protected
_rminlca::MinLCAVertexOrderSA< Greedy, Graph >protected
_resultminlca::MinLCAVertexOrderSA< Greedy, Graph >protected
_sminlca::MinLCA< Graph >protected
_saminlca::MinLCAVertexOrderSA< Greedy, Graph >protected
BaseLCA typedef (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >protected
Colouring typedefminlca::MinLCA< Graph >
colouring() const minlca::MinLCA< Graph >inline
GreedyNodeSA (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >friend
init()minlca::MinLCAVertexOrderSA< Greedy, Graph >inlineprotectedvirtual
init(int steps, int stIter, int k, double lambda, bool initial=false)minlca::MinLCAVertexOrderSA< Greedy, Graph >inlinevirtual
lcaValue() const minlca::MinLCA< Graph >inline
lemon::BfsVisit< Graph, SAorder > (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >friend
maxK()minlca::MinLCA< Graph >inline
MinLCA(const Graph &g, int maxK=0)minlca::MinLCA< Graph >inlineprotected
MinLCAVertexOrderSA(const Graph &g, int maxK=0, int seed=0)minlca::MinLCAVertexOrderSA< Greedy, Graph >inline
operator[](const Node &v) const minlca::MinLCA< Graph >inline
operator[](const Edge &e) const minlca::MinLCA< Graph >inline
process(const Node &v) (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >inlineprivate
recalculateLca()minlca::MinLCA< Graph >inline
run()minlca::MinLCAVertexOrderSA< Greedy, Graph >inlinevirtual
SAorder typedef (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >protected
setColour(const Node &v, int vColour)minlca::MinLCA< Graph >inlineprotectedvirtual
setRandom(lemon::Random *r, bool deleteRandom=false)minlca::MinLCAVertexOrderSA< Greedy, Graph >inline
setSolutionFound()minlca::MinLCA< Graph >inlineprotected
setSolutionNotFound()minlca::MinLCA< Graph >inlineprotected
status() const minlca::MinLCA< Graph >inline
TEMPLATE_GRAPH_TYPEDEFS(Graph) (defined in minlca::MinLCAVertexOrderSA< Greedy, Graph >)minlca::MinLCAVertexOrderSA< Greedy, Graph >private
totalColours() const minlca::MinLCA< Graph >inline
~MinLCAVertexOrderSA()minlca::MinLCAVertexOrderSA< Greedy, Graph >inline