PlanarSubgraphEmpty.h File Reference

Declaration and Implementation of class PlanarSubgraphEmpty. Heuristic: We obtain a planar subgraph by putting all edges in delEdges. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/Module.h>
#include <ogdf/planarity/PlanarSubgraphModule.h>

Go to the source code of this file.

Classes
class	ogdf::List< E >
	Doubly linked lists (maintaining the length of the list). More...
class	ogdf::PlanarSubgraphEmpty< TCost >
	Dummy implementation for maximum planar subgraph that returns an empty graph. More...

Namespaces
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration and Implementation of class PlanarSubgraphEmpty. Heuristic: We obtain a planar subgraph by putting all edges in delEdges.

Author

Tilo Wiedera

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