OpenGraph DrawingFramework

v.2012.07

GreedyCycleRemoval.h File Reference

Declaration of class GeedyCycleRemoval. More...

#include <ogdf/module/AcyclicSubgraphModule.h>
#include <ogdf/basic/NodeArray.h>

Go to the source code of this file.

Classes

class  ogdf::GreedyCycleRemoval
Greedy algorithm for computing a maximal acyclic subgraph. More...

Namespaces

namespace  ogdf
The namespace for all OGDF objects.

Macros

#define OGDF_GREEDY_CYCLE_REMOVAL_H

Detailed Description

Declaration of class GeedyCycleRemoval.

This file is part of the Open Graph Drawing Framework (OGDF).
See README.txt in the root directory of the OGDF installation 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.