Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::MinSteinerTreeDirectedCut< T > Member List

This is the complete list of members for ogdf::MinSteinerTreeDirectedCut< 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
call(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree)ogdf::MinSteinerTreeModule< T >virtual
computeSteinerTree(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree) overrideogdf::MinSteinerTreeDirectedCut< T >protectedvirtual
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
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_addDegreeConstraintsogdf::MinSteinerTreeDirectedCut< T >protected
m_addFlowBalanceConstraintsogdf::MinSteinerTreeDirectedCut< T >protected
m_addGSEC2Constraintsogdf::MinSteinerTreeDirectedCut< T >protected
m_addIndegreeEdgeConstraintsogdf::MinSteinerTreeDirectedCut< T >protected
m_backCutComputationogdf::MinSteinerTreeDirectedCut< T >protected
m_callPrimalHeuristicogdf::MinSteinerTreeDirectedCut< T >protected
m_configFileogdf::MinSteinerTreeDirectedCut< T >protected
m_epsogdf::MinSteinerTreeDirectedCut< T >protected
m_maxFlowModuleOptionogdf::MinSteinerTreeDirectedCut< T >protected
m_maxNrAddedCuttingPlanesogdf::MinSteinerTreeDirectedCut< T >protected
m_minCardinalityCutsogdf::MinSteinerTreeDirectedCut< T >protected
m_nestedCutComputationogdf::MinSteinerTreeDirectedCut< T >protected
m_poolSizeInitFactorogdf::MinSteinerTreeDirectedCut< T >protected
m_primalHeuristicogdf::MinSteinerTreeDirectedCut< T >protected
m_saturationStrategyogdf::MinSteinerTreeDirectedCut< T >protected
m_separationStrategyogdf::MinSteinerTreeDirectedCut< T >protected
m_shuffleTerminalsogdf::MinSteinerTreeDirectedCut< T >protected
MinSteinerTreeDirectedCut()ogdf::MinSteinerTreeDirectedCut< 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
setConfigFile(const char *configfile)ogdf::MinSteinerTreeDirectedCut< T >inline
setEpsilon(double eps)ogdf::MinSteinerTreeDirectedCut< T >inline
setMaxFlowModule(MaxFlowModule< double > *module)ogdf::MinSteinerTreeDirectedCut< T >inline
setMaxNumberAddedCuttingPlanes(int b)ogdf::MinSteinerTreeDirectedCut< T >inline
setPoolSizeInitFactor(int b)ogdf::MinSteinerTreeDirectedCut< T >inline
setPrimalHeuristic(MinSteinerTreeModule< double > *b)ogdf::MinSteinerTreeDirectedCut< T >inline
setPrimalHeuristicCallStrategy(int b)ogdf::MinSteinerTreeDirectedCut< T >inline
setSaturationStrategy(int b)ogdf::MinSteinerTreeDirectedCut< T >inline
setSeparationStrategy(int b)ogdf::MinSteinerTreeDirectedCut< 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
useBackCuts(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useDegreeConstraints(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useFlowBalanceConstraints(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useGSEC2Constraints(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useIndegreeEdgeConstraints(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useMinCardinalityCuts(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useNestedCuts(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
useTerminalShuffle(bool b)ogdf::MinSteinerTreeDirectedCut< T >inline
~MinSteinerTreeModule()ogdf::MinSteinerTreeModule< T >inlinevirtual