| addComponent(NodeArray< bool > &isNewTerminal, const BlowupGraph< T > &blowupGraph, const edge rootEdge) | ogdf::steiner_tree::goemans::Approximation< T > | inlineprivate |
| Approximation(const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, const FullComponentWithExtraStore< T, double > &fullCompStore, const std::minstd_rand &rng, double eps=1e-8) | ogdf::steiner_tree::goemans::Approximation< T > | inline |
| findCheapestComponentAndRemainingBasis(std::unique_ptr< ArrayBuffer< std::pair< node, int >>> &maxBasis, const BlowupGraph< T > &blowupGraph, const BlowupComponents< T > &gamma) | ogdf::steiner_tree::goemans::Approximation< T > | inlineprivate |
| findComponentAndMaxBasis(std::unique_ptr< ArrayBuffer< std::pair< node, int >>> &maxBasis, BlowupGraph< T > &blowupGraph, const BlowupComponents< T > &gamma) | ogdf::steiner_tree::goemans::Approximation< T > | inlineprivate |
| gammoidGetRank(const BlowupGraph< T > &blowupGraph) const | ogdf::steiner_tree::goemans::Approximation< T > | inlineprivate |
| m_eps | ogdf::steiner_tree::goemans::Approximation< T > | private |
| m_fullCompStore | ogdf::steiner_tree::goemans::Approximation< T > | private |
| m_G | ogdf::steiner_tree::goemans::Approximation< T > | private |
| m_isTerminal | ogdf::steiner_tree::goemans::Approximation< T > | private |
| m_rng | ogdf::steiner_tree::goemans::Approximation< T > | private |
| m_terminals | ogdf::steiner_tree::goemans::Approximation< T > | private |
| removeFractionalBasisAndCleanup(ArrayBuffer< std::pair< node, int >> &basis, BlowupGraph< T > &blowupGraph, BlowupComponents< T > &gamma) | ogdf::steiner_tree::goemans::Approximation< T > | inlineprivate |
| solve(NodeArray< bool > &isNewTerminal) | ogdf::steiner_tree::goemans::Approximation< T > | |
