Implementation of Mehlhorn's minimum Steiner tree 2(1-1/l)-approximation algorithm. More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/extended_graph_alg.h>
#include <ogdf/graphalg/MinSteinerTreeModule.h>
#include <ogdf/graphalg/Voronoi.h>
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>
Go to the source code of this file.
Classes | |
class | ogdf::EdgeWeightedGraph< T > |
class | ogdf::MinSteinerTreeMehlhorn< T > |
This class implements the Minimum Steiner Tree 2-approximation algorithm by Mehlhorn. More... | |
struct | ogdf::MinSteinerTreeMehlhorn< T >::MehlhornTriple |
Represents a triple as specified in the algorithms description (see paper) More... | |
class | ogdf::MinSteinerTreeMehlhorn< T >::MehlhornTripleBucketMaxFunc |
Helper class to sort MehlhornTriples lexicographically. More... | |
class | ogdf::MinSteinerTreeMehlhorn< T >::MehlhornTripleBucketMinFunc |
Helper class to sort MehlhornTriples lexicographically. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::steiner_tree | |
Functions | |
template<typename T > | |
T | ogdf::steiner_tree::constructTerminalSpanningTreeUsingVoronoiRegions (EdgeWeightedGraphCopy< T > &terminalSpanningTree, const EdgeWeightedGraph< T > &graph, const List< node > &terminals) |
Implementation of Mehlhorn's minimum Steiner tree 2(1-1/l)-approximation algorithm.
Definition in file MinSteinerTreeMehlhorn.h.