Definition of the ogdf::SteinerTreePreprocessing class template. More...
#include <ogdf/basic/Array.h>
#include <ogdf/basic/BoundedQueue.h>
#include <ogdf/basic/EpsilonTest.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/Math.h>
#include <ogdf/basic/PriorityQueue.h>
#include <ogdf/basic/SubsetEnumerator.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/extended_graph_alg.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/Dijkstra.h>
#include <ogdf/graphalg/MinSteinerTreeMehlhorn.h>
#include <ogdf/graphalg/MinSteinerTreeTakahashi.h>
#include <ogdf/graphalg/SteinerTreeLowerBoundDualAscent.h>
#include <ogdf/graphalg/Voronoi.h>
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraph.h>
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>
#include <ogdf/graphalg/steiner_tree/HeavyPathDecomposition.h>
#include <algorithm>
#include <forward_list>
#include <functional>
#include <iostream>
#include <limits>
#include <memory>
#include <set>
#include <unordered_map>
#include <utility>
#include <vector>
Go to the source code of this file.
Classes | |
class | ogdf::MinSteinerTreeModule< T > |
Serves as an interface for various methods to compute or approximate minimum Steiner trees on undirected graphs with edge costs. More... | |
class | ogdf::steiner_tree::UnorderedNodePairEquality |
A class used by the unordered_maps inside the reductions. More... | |
class | ogdf::steiner_tree::UnorderedNodePairHasher |
A class used by the unordered_maps inside the reductions. More... | |
class | ogdf::SteinerTreePreprocessing< T > |
This class implements preprocessing strategies for the Steiner tree problem. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::steiner_tree | |
Definition of the ogdf::SteinerTreePreprocessing class template.
Definition in file SteinerTreePreprocessing.h.