SteinerTreePreprocessing.h File Reference

Definition of the ogdf::SteinerTreePreprocessing class template. More...

#include <ogdf/basic/BoundedQueue.h>
#include <ogdf/basic/SubsetEnumerator.h>
#include <ogdf/graphalg/MinSteinerTreeMehlhorn.h>
#include <ogdf/graphalg/MinSteinerTreeTakahashi.h>
#include <ogdf/graphalg/SteinerTreeLowerBoundDualAscent.h>
#include <ogdf/graphalg/steiner_tree/HeavyPathDecomposition.h>
#include <forward_list>
#include <memory>
#include <set>
#include <unordered_map>

Go to the source code of this file.

Classes
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
namespace	ogdf
	The namespace for all OGDF objects.
namespace	ogdf::steiner_tree

Detailed Description

Definition of the ogdf::SteinerTreePreprocessing class template.

Author

Mihai Popa

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file SteinerTreePreprocessing.h.