Algorithms used by at least two functions of Steiner tree code or its internal helpers. More...
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/comparer.h>
#include <ogdf/graphalg/MinSteinerTreeModule.h>
#include <ogdf/graphalg/MinSteinerTreeTakahashi.h>
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>
#include <limits>
Go to the source code of this file.
Classes | |
class | ogdf::EdgeWeightedGraph< T > |
class | ogdf::steiner_tree::Triple< T > |
This class represents a triple used by various contraction-based minimum Steiner tree approximations. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::steiner_tree | |
Functions | |
template<typename T > | |
node | ogdf::steiner_tree::buildHeaviestEdgeInComponentTree (const EdgeWeightedGraphCopy< T > &inputTree, NodeArray< node > &externalNodes, NodeArray< edge > &treeEdge, Graph &outputTree) |
Given an edge-weighted tree, builds an auxiliary arborescence where each arc of the input tree is a node in the arborescence. More... | |
template<typename T > | |
void | ogdf::steiner_tree::contractTripleInSteinerTree (const Triple< T > &t, EdgeWeightedGraphCopy< T > &st, edge e0, edge e1, edge e2) |
template<typename T > | |
void | ogdf::steiner_tree::contractTripleInSteinerTree (const Triple< T > &t, EdgeWeightedGraphCopy< T > &st, edge save0, edge save1, edge save2, edge &ne0, edge &ne1) |
Updates the Steiner tree by deleting save edges, removing all direct connections between the terminals of the contracted triple and connecting them through 0-cost edges. More... | |
template<typename T > | |
T | ogdf::steiner_tree::obtainFinalSteinerTree (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, const NodeArray< bool > &isOriginalTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree) |
Algorithms used by at least two functions of Steiner tree code or its internal helpers.
Definition in file common_algorithms.h.