PMatching.h File Reference

Manages the matching of P-nodes via pipes in an instance of SyncPlan. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/cluster/sync_plan/utils/Bijection.h>
#include <functional>
#include <memory>
#include <ostream>
#include <utility>

Go to the source code of this file.

Classes
struct	ogdf::sync_plan::Pipe
	A pair of matched vertices of the same degree, whose rotation shall be synchronized. More...
struct	ogdf::sync_plan::PipeQueue
	A queue of all pipes, ordered by an arbitrary comparator function. More...
class	ogdf::sync_plan::PMatching
	Manages the matching of P-nodes via pipes in an instance of SyncPlan. More...

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

Enumerations
enum class	ogdf::sync_plan::PipeType { ogdf::sync_plan::BlockBlock , ogdf::sync_plan::BlockCut , ogdf::sync_plan::CutCut }

Detailed Description

Manages the matching of P-nodes via pipes in an instance of SyncPlan.

Author

Simon D. Fink ogdf@.nosp@m.niko.nosp@m..fink.nosp@m..bay.nosp@m.ern

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