Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::SteinerTreePreprocessing< T > Member List

This is the complete list of members for ogdf::SteinerTreePreprocessing< T >, including all inherited members.

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) constogdf::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) constogdf::SteinerTreePreprocessing< T >protected
computeClosestKTerminals(const int k, NodeArray< List< std::pair< node, T >>> &closestTerminals) constogdf::SteinerTreePreprocessing< T >protected
computeMinSteinerTreeUpperBound(EdgeWeightedGraphCopy< T > *&finalSteinerTree) constogdf::SteinerTreePreprocessing< T >inlineprotected
computeMinSteinerTreeUpperBound() constogdf::SteinerTreePreprocessing< T >inlineprotected
computeOptimalTerminals(node v, LAMBDA dist, node &optimalTerminal1, node &optimalTerminal2, NodeArray< T > &distance) constogdf::SteinerTreePreprocessing< T >protected
computeOriginalSolution(const EdgeWeightedGraphCopy< T > &reducedGraphSolution, EdgeWeightedGraphCopy< T > &correspondingOriginalSolution)ogdf::SteinerTreePreprocessing< T >
computeRadiusOfTerminals(NodeArray< T > &terminalRadius) constogdf::SteinerTreePreprocessing< T >protected
computeRadiusSum() constogdf::SteinerTreePreprocessing< T >protected
computeShortestPathMatrix(NodeArray< NodeArray< T >> &shortestPath) constogdf::SteinerTreePreprocessing< T >inlineprotected
costEdgesAlreadyInserted() constogdf::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) constogdf::SteinerTreePreprocessing< T >protected
findTwoMinimumCostEdges(node v, edge &first, edge &second) constogdf::SteinerTreePreprocessing< T >protected
floydWarshall(NodeArray< NodeArray< T >> &shortestPath) constogdf::SteinerTreePreprocessing< T >protected
getReducedGraph() constogdf::SteinerTreePreprocessing< T >inline
getReducedIsTerminal() constogdf::SteinerTreePreprocessing< T >inline
getReducedTerminals() constogdf::SteinerTreePreprocessing< T >inline
leastCostTest()ogdf::SteinerTreePreprocessing< T >
longEdgesTest()ogdf::SteinerTreePreprocessing< T >
lowerBoundBasedTest(T upperBound)ogdf::SteinerTreePreprocessing< T >
lowerBoundBasedTest()ogdf::SteinerTreePreprocessing< T >inline
m_copyGraphogdf::SteinerTreePreprocessing< T >protected
m_copyIsTerminalogdf::SteinerTreePreprocessing< T >protected
m_copyTerminalsogdf::SteinerTreePreprocessing< T >protected
m_costAlreadyInsertedogdf::SteinerTreePreprocessing< T >protected
m_costUpperBoundAlgorithmogdf::SteinerTreePreprocessing< T >protected
m_edgeSonsListIndexogdf::SteinerTreePreprocessing< T >protected
m_epsogdf::SteinerTreePreprocessing< T >protected
m_nodeSonsListIndexogdf::SteinerTreePreprocessing< T >protected
m_origGraphogdf::SteinerTreePreprocessing< T >protected
m_origIsTerminalogdf::SteinerTreePreprocessing< T >protected
m_origTerminalsogdf::SteinerTreePreprocessing< T >protected
m_sonsListogdf::SteinerTreePreprocessing< T >protected
makeSimple()ogdf::SteinerTreePreprocessing< T >
markSuccessors(node currentNode, const Voronoi< T > &voronoiRegions, NodeArray< bool > &isSuccessorOfMinCostEdge) constogdf::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 >