addEdgesToSolution(const List< edge > &edgesToBeAddedInSolution) | ogdf::SteinerTreePreprocessing< T > | protected |
addNew(TWhat x, const std::vector< node > &replacedNodes, const std::vector< edge > &replacedEdges, bool deleteReplacedElements, TWhatArray &whatSonsListIndex) | ogdf::SteinerTreePreprocessing< T > | protected |
addNewEdge(edge e, const std::vector< node > &replacedNodes, const std::vector< edge > &replacedEdges, bool deleteReplacedElements) | ogdf::SteinerTreePreprocessing< T > | inlineprotected |
addNewNode(node v, const std::vector< node > &replacedNodes, const std::vector< edge > &replacedEdges, bool deleteReplacedElements) | ogdf::SteinerTreePreprocessing< T > | inlineprotected |
addToSolution(const int listIndex, Array< bool, int > &isInSolution) const | ogdf::SteinerTreePreprocessing< T > | protected |
computeBottleneckDistance(node x, node y, const EdgeWeightedGraphCopy< T > &tprime, const steiner_tree::HeavyPathDecomposition< T > &tprimeHPD, const NodeArray< List< std::pair< node, T >>> &closestTerminals) const | ogdf::SteinerTreePreprocessing< T > | protected |
computeClosestKTerminals(const int k, NodeArray< List< std::pair< node, T >>> &closestTerminals) const | ogdf::SteinerTreePreprocessing< T > | protected |
computeMinSteinerTreeUpperBound(EdgeWeightedGraphCopy< T > *&finalSteinerTree) const | ogdf::SteinerTreePreprocessing< T > | inlineprotected |
computeMinSteinerTreeUpperBound() const | ogdf::SteinerTreePreprocessing< T > | inlineprotected |
computeOptimalTerminals(node v, LAMBDA dist, node &optimalTerminal1, node &optimalTerminal2, NodeArray< T > &distance) const | ogdf::SteinerTreePreprocessing< T > | protected |
computeOriginalSolution(const EdgeWeightedGraphCopy< T > &reducedGraphSolution, EdgeWeightedGraphCopy< T > &correspondingOriginalSolution) | ogdf::SteinerTreePreprocessing< T > | |
computeRadiusOfTerminals(NodeArray< T > &terminalRadius) const | ogdf::SteinerTreePreprocessing< T > | protected |
computeRadiusSum() const | ogdf::SteinerTreePreprocessing< T > | protected |
computeShortestPathMatrix(NodeArray< NodeArray< T >> &shortestPath) const | ogdf::SteinerTreePreprocessing< T > | inlineprotected |
costEdgesAlreadyInserted() const | ogdf::SteinerTreePreprocessing< T > | inline |
cutReachabilityTest() | ogdf::SteinerTreePreprocessing< T > | |
degree2Test() | ogdf::SteinerTreePreprocessing< T > | |
deleteComponentsWithoutTerminals() | ogdf::SteinerTreePreprocessing< T > | |
deleteEdgesAboveUpperBound(const EdgeArray< T > &lowerBoundWithEdge, const T upperBound) | ogdf::SteinerTreePreprocessing< T > | protected |
deleteLeaves() | ogdf::SteinerTreePreprocessing< T > | |
deleteNodesAboveUpperBound(const NodeArray< T > &lowerBoundWithNode, const T upperBound) | ogdf::SteinerTreePreprocessing< T > | protected |
deleteSteinerDegreeTwoNode(node v, const EdgeWeightedGraphCopy< T > &tprime, const steiner_tree::HeavyPathDecomposition< T > &tprimeHPD, const NodeArray< List< std::pair< node, T >>> &closestTerminals) | ogdf::SteinerTreePreprocessing< T > | protected |
dualAscentBasedTest(int repetitions, T upperBound) | ogdf::SteinerTreePreprocessing< T > | |
dualAscentBasedTest(int repetitions=1) | ogdf::SteinerTreePreprocessing< T > | inline |
findClosestNonTerminals(node source, List< node > &reachedNodes, NodeArray< T > &distance, T maxDistance, int expandedEdges) const | ogdf::SteinerTreePreprocessing< T > | protected |
findTwoMinimumCostEdges(node v, edge &first, edge &second) const | ogdf::SteinerTreePreprocessing< T > | protected |
floydWarshall(NodeArray< NodeArray< T >> &shortestPath) const | ogdf::SteinerTreePreprocessing< T > | protected |
getReducedGraph() const | ogdf::SteinerTreePreprocessing< T > | inline |
getReducedIsTerminal() const | ogdf::SteinerTreePreprocessing< T > | inline |
getReducedTerminals() const | ogdf::SteinerTreePreprocessing< T > | inline |
leastCostTest() | ogdf::SteinerTreePreprocessing< T > | |
longEdgesTest() | ogdf::SteinerTreePreprocessing< T > | |
lowerBoundBasedTest(T upperBound) | ogdf::SteinerTreePreprocessing< T > | |
lowerBoundBasedTest() | ogdf::SteinerTreePreprocessing< T > | inline |
m_copyGraph | ogdf::SteinerTreePreprocessing< T > | protected |
m_copyIsTerminal | ogdf::SteinerTreePreprocessing< T > | protected |
m_copyTerminals | ogdf::SteinerTreePreprocessing< T > | protected |
m_costAlreadyInserted | ogdf::SteinerTreePreprocessing< T > | protected |
m_costUpperBoundAlgorithm | ogdf::SteinerTreePreprocessing< T > | protected |
m_edgeSonsListIndex | ogdf::SteinerTreePreprocessing< T > | protected |
m_eps | ogdf::SteinerTreePreprocessing< T > | protected |
m_nodeSonsListIndex | ogdf::SteinerTreePreprocessing< T > | protected |
m_origGraph | ogdf::SteinerTreePreprocessing< T > | protected |
m_origIsTerminal | ogdf::SteinerTreePreprocessing< T > | protected |
m_origTerminals | ogdf::SteinerTreePreprocessing< T > | protected |
m_sonsList | ogdf::SteinerTreePreprocessing< T > | protected |
makeSimple() | ogdf::SteinerTreePreprocessing< T > | |
markSuccessors(node currentNode, const Voronoi< T > &voronoiRegions, NodeArray< bool > &isSuccessorOfMinCostEdge) const | ogdf::SteinerTreePreprocessing< T > | protected |
nearestVertexTest() | ogdf::SteinerTreePreprocessing< T > | |
NTDkTest(const int maxTestedDegree=5, const int k=3) | ogdf::SteinerTreePreprocessing< T > | |
PTmTest(const int k=3) | ogdf::SteinerTreePreprocessing< T > | |
reachabilityTest(int maxDegreeTest=0, const int k=3) | ogdf::SteinerTreePreprocessing< T > | |
recomputeTerminalsList() | ogdf::SteinerTreePreprocessing< T > | protected |
reduceFast() | ogdf::SteinerTreePreprocessing< T > | inline |
reduceFastAndDualAscent() | ogdf::SteinerTreePreprocessing< T > | inline |
reduceTrivial() | ogdf::SteinerTreePreprocessing< T > | inline |
repeat(std::function< bool()> f) | ogdf::SteinerTreePreprocessing< T > | inlinestatic |
setCostUpperBoundAlgorithm(MinSteinerTreeModule< T > *pMinSteinerTreeModule) | ogdf::SteinerTreePreprocessing< T > | inline |
shortLinksTest() | ogdf::SteinerTreePreprocessing< T > | |
shuffleReducedTerminals() | ogdf::SteinerTreePreprocessing< T > | inline |
solve(MinSteinerTreeModule< T > &mst, EdgeWeightedGraphCopy< T > *&finalSteinerTree) | ogdf::SteinerTreePreprocessing< T > | inline |
SteinerTreePreprocessing(const EdgeWeightedGraph< T > &wg, const List< node > &terminals, const NodeArray< bool > &isTerminal) | ogdf::SteinerTreePreprocessing< T > | |
terminalDistanceTest() | ogdf::SteinerTreePreprocessing< T > | |