MaxSequencePQTree.h File Reference

Declaration and definition of the class MaxSequencePQTree. More...

#include <ogdf/basic/ArrayBuffer.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/PQTree.h>
#include <ogdf/basic/Queue.h>
#include <ogdf/basic/SList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/pqtree/PQNode.h>
#include <ogdf/basic/pqtree/PQNodeKey.h>
#include <ogdf/basic/pqtree/PQNodeRoot.h>
#include <ogdf/planarity/planar_subgraph_fast/whaInfo.h>

Go to the source code of this file.

Classes
class	ogdf::MaxSequencePQTree< T, Y >
	The class template MaxSequencePQTree is designed to compute a maximal consecutive sequence of pertinent leaves in a PQ-tree. More...

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration and definition of the class MaxSequencePQTree.

Derivedsfrom base class PQTree and computes a maximal sequence of pertinent leaves that can be reduced.

Author

Sebastian Leipert

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