Full 3-component generation using enumeration. More...
#include <ogdf/graphalg/steiner_tree/Full3ComponentGeneratorEnumeration.h>
Public Member Functions | |
void | call (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, const NodeArray< NodeArray< T > > &distance, const NodeArray< NodeArray< edge > > &pred, std::function< void(node, node, node, node, T)> generateFunction) const |
Generate full components and call generateFunction for each full component. | |
Public Member Functions inherited from ogdf::steiner_tree::Full3ComponentGeneratorModule< T > | |
Full3ComponentGeneratorModule ()=default | |
virtual | ~Full3ComponentGeneratorModule ()=default |
Additional Inherited Members | |
Protected Member Functions inherited from ogdf::steiner_tree::Full3ComponentGeneratorModule< T > | |
void | checkAndGenerateFunction (node u, node v, node w, node center, T minCost, const NodeArray< NodeArray< edge > > &pred, const NodeArray< bool > &isTerminal, std::function< void(node, node, node, node, T)> generateFunction) const |
void | forAllTerminalTriples (const List< node > &terminals, const NodeArray< NodeArray< T > > &distance, std::function< void(node, node, node, const NodeArray< T > &, const NodeArray< T > &, const NodeArray< T > &)> func) const |
void | updateBestCenter (node x, node ¢er, T &minCost, const NodeArray< T > &dist1, const NodeArray< T > &dist2, const NodeArray< T > &dist3) const |
Update center node if it is the best so far. | |
Full 3-component generation using enumeration.
Definition at line 41 of file Full3ComponentGeneratorEnumeration.h.
|
inlinevirtual |
Generate full components and call generateFunction
for each full component.
Implements ogdf::steiner_tree::Full3ComponentGeneratorModule< T >.
Definition at line 43 of file Full3ComponentGeneratorEnumeration.h.