41class EdgeWeightedGraph;
43namespace steiner_tree {
57 std::function<
void(
node,
node, T)> generateFunction)
const {
63 generateFunction(u, v, distance[u][v]);
Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Doubly linked lists (maintaining the length of the list).
Encapsulates a pointer to a list element.
ListIteratorBase< E, isConst, isReverse > succ() const
Returns successor iterator.
iterator begin()
Returns an iterator to the first element of the list.
Class for the representation of nodes.
RegisteredArray for nodes, edges and adjEntries of a graph.
Trivial full 2-component generation by lookups of shortest paths between terminal pairs.
void call(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< NodeArray< T > > &distance, const NodeArray< NodeArray< edge > > &pred, std::function< void(node, node, T)> generateFunction) const
Generate full 2-components and call generateFunction for each full 2-component.
The namespace for all OGDF objects.