| 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 |
| bnbInternal(T prevCost, List< edge > ¤tEdges) | ogdf::MinSteinerTreeShore< T > | private |
| 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) override | ogdf::MinSteinerTreeShore< T > | protectedvirtual |
| deleteEdge(edge e) | ogdf::MinSteinerTreeShore< T > | private |
| determineBranchingEdge(T prevCost) const | ogdf::MinSteinerTreeShore< T > | private |
| 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 |
| isTerminal(const node v) const | ogdf::MinSteinerTreeShore< T > | private |
| lookupEdge(const node u, const node v) const | ogdf::MinSteinerTreeShore< T > | private |
| m_chosenEdges | ogdf::MinSteinerTreeShore< T > | private |
| m_edges | ogdf::MinSteinerTreeShore< T > | private |
| m_graph | ogdf::MinSteinerTreeShore< T > | private |
| m_mapping | ogdf::MinSteinerTreeShore< T > | private |
| m_originalGraph | ogdf::MinSteinerTreeShore< T > | private |
| m_originalTerminals | ogdf::MinSteinerTreeShore< T > | private |
| m_recursionDepth | ogdf::MinSteinerTreeShore< T > | private |
| m_terminals | ogdf::MinSteinerTreeShore< T > | private |
| m_upperBound | ogdf::MinSteinerTreeShore< T > | private |
| MAX_WEIGHT | ogdf::MinSteinerTreeShore< T > | protected |
| MinSteinerTreeShore() | ogdf::MinSteinerTreeShore< T > | inline |
| moveSource(edge e, node v) | ogdf::MinSteinerTreeShore< T > | private |
| moveTarget(edge e, node v) | ogdf::MinSteinerTreeShore< T > | private |
| newEdge(node source, node target, const edge originalEdge) | ogdf::MinSteinerTreeShore< T > | private |
| printSVG() | ogdf::MinSteinerTreeShore< T > | private |
| 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 |
| setEdgeLookup(const node u, const node v, const edge e) | ogdf::MinSteinerTreeShore< T > | private |
| setTerminal(const node v, bool makeTerminal) | ogdf::MinSteinerTreeShore< T > | private |
| 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 |
| solve(List< edge > &chosenEdges) | ogdf::MinSteinerTreeShore< T > | private |
| 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 |
| validateMapping() const | ogdf::MinSteinerTreeShore< T > | private |
| weightOf(edge e) const | ogdf::MinSteinerTreeShore< T > | private |
| ~MinSteinerTreeModule() | ogdf::MinSteinerTreeModule< T > | inlinevirtual |
| ~MinSteinerTreeShore() | ogdf::MinSteinerTreeShore< T > | inlinevirtual |
