Definition of ogdf::steiner_tree::goemans::Approximation class template. More...
#include <ogdf/basic/ArrayBuffer.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/comparer.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/MaxFlowGoldbergTarjan.h>
#include <ogdf/graphalg/MinCostFlowReinelt.h>
#include <ogdf/graphalg/steiner_tree/goemans/BlowupComponents.h>
#include <ogdf/graphalg/steiner_tree/goemans/BlowupGraph.h>
#include <ogdf/graphalg/steiner_tree/goemans/CoreEdgeRandomSpanningTree.h>
#include <iostream>
#include <memory>
#include <random>
#include <utility>
Go to the source code of this file.
Classes | |
class | ogdf::EdgeWeightedGraph< T > |
class | ogdf::List< E > |
Doubly linked lists (maintaining the length of the list). More... | |
class | ogdf::steiner_tree::FullComponentWithExtraStore< T, ExtraDataType > |
A data structure to store full components with extra data for each component. More... | |
class | ogdf::steiner_tree::goemans::Approximation< T > |
The actual 1.39-approximation algorithm by Goemans et al. with a set of terminalized nodes as result. More... | |
struct | ogdf::steiner_tree::goemans::Approximation< T >::TemporaryEdges |
Add edges into a blowup graph and delete them on destruction. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::steiner_tree | |
ogdf::steiner_tree::goemans | |
Definition of ogdf::steiner_tree::goemans::Approximation class template.
Definition in file Approximation.h.