MinLCA algorithms
minlca::MinLCAGreedyNearest< Graph > Member List

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

_cminlca::MinLCA< Graph >protected
_gminlca::MinLCA< Graph >protected
_kminlca::MinLCA< Graph >protected
_lcaminlca::MinLCA< Graph >protected
_max_kminlca::MinLCA< Graph >protected
_sminlca::MinLCA< Graph >protected
Base typedefminlca::MinLCAGreedyNearest< Graph >protected
colouring() const minlca::MinLCA< Graph >inline
Colouring typedefminlca::MinLCA< Graph >
init()minlca::MinLCA< Graph >inlinevirtual
lcaValue() const minlca::MinLCA< Graph >inline
maxK()minlca::MinLCA< Graph >inline
MinLCA(const Graph &g, int maxK=0)minlca::MinLCA< Graph >inlineprotected
MinLCAGreedy(const Graph &g, int maxK=0)minlca::MinLCAGreedy< Graph >inlineprotected
MinLCAGreedyNearest(const Graph &g, int maxK=0)minlca::MinLCAGreedyNearest< Graph >inlineprotected
operator[](const Node &v) const minlca::MinLCA< Graph >inline
operator[](const Edge &e) const minlca::MinLCA< Graph >inline
paintVertex(const Node &v)minlca::MinLCAGreedyNearest< Graph >inlineprotectedvirtual
recalculateLca()minlca::MinLCA< Graph >inline
run()minlca::MinLCA< Graph >inlinevirtual
setColour(const Node &v, int vColour)minlca::MinLCA< Graph >inlineprotectedvirtual
setSolutionFound()minlca::MinLCA< Graph >inlineprotected
setSolutionNotFound()minlca::MinLCA< Graph >inlineprotected
status() const minlca::MinLCA< Graph >inline
TEMPLATE_GRAPH_TYPEDEFS(Graph) (defined in minlca::MinLCAGreedyNearest< Graph >)minlca::MinLCAGreedyNearest< Graph >private
totalColours() const minlca::MinLCA< Graph >inline