SteinerTreeLowerBoundDualAscent.h File Reference

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

#include <ogdf/basic/EpsilonTest.h>
#include <ogdf/basic/Math.h>
#include <ogdf/graphalg/Dijkstra.h>
#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraph.h>

Go to the source code of this file.

Classes
class	ogdf::steiner_tree::LowerBoundDualAscent< T >
	Computes lower bounds for minimum Steiner tree instances. More...
struct	ogdf::steiner_tree::LowerBoundDualAscent< T >::TerminalData
struct	ogdf::steiner_tree::LowerBoundDualAscent< T >::TerminalDataReference
class	ogdf::SteinerTreeLowerBoundDualAscent< T >
	Implementation of a dual-ascent-based lower bound heuristic for Steiner tree problems. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
namespace	ogdf::steiner_tree

Detailed Description

Definition of the ogdf::SteinerTreeLowerBoundDualAscent class template.

Author

Stephan Beyer

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 SteinerTreeLowerBoundDualAscent.h.