Definition of the ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix class template. More...
#include <ogdf/basic/Hashing.h>#include <ogdf/basic/Math.h>#include <ogdf/basic/SubsetEnumerator.h>#include <ogdf/graphalg/MinSteinerTreeModule.h>#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>Go to the source code of this file.
Classes | |
| class | ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T > |
| A generator for restricted full components (for Steiner tree approximations) based on the Dreyfus-Wagner algorithm that does not need a precomputed all-pair-shortest-paths matrix because single-source-shortest-path are used within. More... | |
| class | ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::AuxiliaryGraph |
| Necessary because ogdf::EdgeWeightedGraphCopy<T> is rubbish. More... | |
| struct | ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::DWMData |
| Subgraphs (given by other subgraphs and additional edges) and their cost for a partial solution. More... | |
| struct | ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::DWMSplit |
| A collection of two subgraphs and their total cost. More... | |
| class | ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix< T >::SortedNodeListHashFunc |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
| namespace | ogdf::steiner_tree |
Definition of the ogdf::steiner_tree::FullComponentGeneratorDreyfusWagnerWithoutMatrix class template.
Definition in file FullComponentGeneratorDreyfusWagnerWithoutMatrix.h.