Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::MinSteinerTreeZelikovsky< T > Member List

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

allNodesByListShortestPaths(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, const NODELIST &nodes, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred, std::function< void(const EdgeWeightedGraph< T > &, node, const NodeArray< bool > &, NodeArray< T > &, NodeArray< edge > &)> ssspFunc)ogdf::MinSteinerTreeModule< T >inlineprivatestatic
allNodeShortestPaths(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred, std::function< void(const EdgeWeightedGraph< T > &, node, const NodeArray< bool > &, NodeArray< T > &, NodeArray< edge > &)> ssspFunc=singleSourceShortestPaths)ogdf::MinSteinerTreeModule< T >inlinestatic
allNodeShortestPathsPreferringTerminals(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
allNodeShortestPathsStandard(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
allPairShortestPaths(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
allPairShortestPathsPreferringTerminals(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >static
allPairShortestPathsStandard(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >static
allTerminalShortestPaths(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred, std::function< void(const EdgeWeightedGraph< T > &, node, const NodeArray< bool > &, NodeArray< T > &, NodeArray< edge > &)> ssspFunc=singleSourceShortestPaths)ogdf::MinSteinerTreeModule< T >inlinestatic
allTerminalShortestPathsPreferringTerminals(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
allTerminalShortestPathsStandard(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
apspInit(const EdgeWeightedGraph< T > &G, NodeArray< NodeArray< T > > &distance, NodeArray< NodeArray< edge > > &pred)ogdf::MinSteinerTreeModule< T >privatestatic
apspInnerLoop(node v, const EdgeWeightedGraph< T > &G, NodeArray< NodeArray< T > > &distance, std::function< void(node, node, T)> func)ogdf::MinSteinerTreeModule< T >inlineprivatestatic
calcWin(double gain, T cost) constogdf::MinSteinerTreeZelikovsky< T >inlineprotected
call(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree) overrideogdf::MinSteinerTreeZelikovsky< T >inlinevirtual
computeDistanceMatrix()ogdf::MinSteinerTreeZelikovsky< T >protected
computeSteinerTree(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree) overrideogdf::MinSteinerTreeZelikovsky< T >protectedvirtual
contractTriple(const Triple< T > &triple, Save< T > &save, NodeArray< bool > &isNewTerminal)ogdf::MinSteinerTreeZelikovsky< T >inlineprotected
drawSteinerTreeSVG(const EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, const char *filename)ogdf::MinSteinerTreeModule< T >static
drawSVG(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, const EdgeWeightedGraphCopy< T > &steinerTree, const char *filename)ogdf::MinSteinerTreeModule< T >static
drawSVG(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, const char *filename)ogdf::MinSteinerTreeModule< T >inlinestatic
findBestTripleForCenter(node center, const Save< T > &save, Triple< T > &maxTriple) constogdf::MinSteinerTreeZelikovsky< T >inlineprotected
forceAPSP(bool force=true)ogdf::MinSteinerTreeZelikovsky< T >inline
generateInitialTerminalSpanningTree(EdgeWeightedGraphCopy< T > &steinerTree)ogdf::MinSteinerTreeZelikovsky< T >inlineprotected
generateTriple(node u, node v, node w, node center, const T &minCost, const Save< T > &save)ogdf::MinSteinerTreeZelikovsky< T >inlineprotected
generateTriples(const Save< T > &save, const steiner_tree::Full3ComponentGeneratorModule< T > &fcg)ogdf::MinSteinerTreeZelikovsky< T >inlineprotected
generateTriples(const Save< T > &save)ogdf::MinSteinerTreeZelikovsky< T >inlineprotected
getNonterminals(ArrayBuffer< node > &nonterminals, const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)ogdf::MinSteinerTreeModule< T >inlinestatic
getTerminals(List< node > &terminals, const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)ogdf::MinSteinerTreeModule< T >inlinestatic
isQuasiBipartite(const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)ogdf::MinSteinerTreeModule< T >static
isSteinerTree(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, const EdgeWeightedGraphCopy< T > &steinerTree)ogdf::MinSteinerTreeModule< T >static
m_distanceogdf::MinSteinerTreeZelikovsky< T >private
m_isTerminalogdf::MinSteinerTreeZelikovsky< T >private
m_originalGraphogdf::MinSteinerTreeZelikovsky< T >private
m_passogdf::MinSteinerTreeZelikovsky< T >private
m_predogdf::MinSteinerTreeZelikovsky< T >private
m_saveCalculationogdf::MinSteinerTreeZelikovsky< T >private
m_ssspDistancesogdf::MinSteinerTreeZelikovsky< T >private
m_terminalsogdf::MinSteinerTreeZelikovsky< T >private
m_tripleGenerationogdf::MinSteinerTreeZelikovsky< T >private
m_tripleLookUpsogdf::MinSteinerTreeZelikovsky< T >private
m_tripleReductionogdf::MinSteinerTreeZelikovsky< T >private
m_triplesogdf::MinSteinerTreeZelikovsky< T >private
m_triplesContractedogdf::MinSteinerTreeZelikovsky< T >private
m_triplesGeneratedogdf::MinSteinerTreeZelikovsky< T >private
m_winCalculationogdf::MinSteinerTreeZelikovsky< T >private
MinSteinerTreeZelikovsky(WinCalculation wc=WinCalculation::absolute, TripleGeneration tg=TripleGeneration::voronoi, SaveCalculation sc=SaveCalculation::hybrid, TripleReduction tr=TripleReduction::on, Pass pass=Pass::multi)ogdf::MinSteinerTreeZelikovsky< T >inline
multiPass(Save< T > &save, NodeArray< bool > &isNewTerminal)ogdf::MinSteinerTreeZelikovsky< T >protected
numberOfContractedTriples() constogdf::MinSteinerTreeZelikovsky< T >inline
numberOfGeneratedTriples() constogdf::MinSteinerTreeZelikovsky< T >inline
numberOfTripleLookUps() constogdf::MinSteinerTreeZelikovsky< T >inline
onePass(Save< T > &save, NodeArray< bool > &isNewTerminal)ogdf::MinSteinerTreeZelikovsky< T >protected
Pass enum nameogdf::MinSteinerTreeZelikovsky< T >
pass(Pass p)ogdf::MinSteinerTreeZelikovsky< T >inline
pass() constogdf::MinSteinerTreeZelikovsky< T >inline
pruneAllDanglingSteinerPaths(EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal)ogdf::MinSteinerTreeModule< T >static
pruneDanglingSteinerPathFrom(EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, node start)ogdf::MinSteinerTreeModule< T >static
pruneDanglingSteinerPathsFrom(EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, const List< node > &start)ogdf::MinSteinerTreeModule< T >static
removeCyclesFrom(EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal)ogdf::MinSteinerTreeModule< T >static
Save typedefogdf::MinSteinerTreeZelikovsky< T >
SaveCalculation enum nameogdf::MinSteinerTreeZelikovsky< T >
saveCalculation(SaveCalculation sv)ogdf::MinSteinerTreeZelikovsky< T >inline
saveCalculation() constogdf::MinSteinerTreeZelikovsky< T >inline
singleSourceShortestPaths(const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &isTerminal, NodeArray< T > &distance, NodeArray< edge > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
singleSourceShortestPathsPreferringTerminals(const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &isTerminal, NodeArray< T > &distance, NodeArray< edge > &pred)ogdf::MinSteinerTreeModule< T >static
singleSourceShortestPathsStandard(const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &, NodeArray< T > &distance, NodeArray< edge > &pred)ogdf::MinSteinerTreeModule< T >inlinestatic
sortTerminals(List< node > &terminals)ogdf::MinSteinerTreeModule< T >inlinestatic
ssspInit(const EdgeWeightedGraph< T > &G, node source, PrioritizedMapQueue< node, T > &queue, NodeArray< T > &distance, NodeArray< edge > &pred)ogdf::MinSteinerTreeModule< T >privatestatic
Triple typedefogdf::MinSteinerTreeZelikovsky< T >
TripleGeneration enum nameogdf::MinSteinerTreeZelikovsky< T >
tripleGeneration(TripleGeneration tg)ogdf::MinSteinerTreeZelikovsky< T >inline
tripleGeneration() constogdf::MinSteinerTreeZelikovsky< T >inline
tripleOnDemand(Save< T > &save, NodeArray< bool > &isNewTerminal)ogdf::MinSteinerTreeZelikovsky< T >protected
tripleReduction(TripleReduction tr)ogdf::MinSteinerTreeZelikovsky< T >inline
tripleReduction() constogdf::MinSteinerTreeZelikovsky< T >inline
TripleReduction enum nameogdf::MinSteinerTreeZelikovsky< T >
WinCalculation enum nameogdf::MinSteinerTreeZelikovsky< T >
winCalculation(WinCalculation wc)ogdf::MinSteinerTreeZelikovsky< T >inline
winCalculation() constogdf::MinSteinerTreeZelikovsky< T >inline
~MinSteinerTreeModule()ogdf::MinSteinerTreeModule< T >inlinevirtual
~MinSteinerTreeZelikovsky()ogdf::MinSteinerTreeZelikovsky< T >inlinevirtual