Declaration of the ClusterAnalysis class for the Branch&Cut algorithm for c-planarity testing via an extension to complete connectivity. The computation of all values is done in an initial step, the results are therefore static, later update of the c-graph does not trigger changes.
More...
Declaration of the ClusterAnalysis class for the Branch&Cut algorithm for c-planarity testing via an extension to complete connectivity. The computation of all values is done in an initial step, the results are therefore static, later update of the c-graph does not trigger changes.
The inner and outer activity status for vertices wrt the clusters is detected and stored for static retrieval. Bag index numbers are computed for vertices that represent their bag affiliation for each cluster.
- Author
- Karsten Klein
- 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 ClusterAnalysis.h.
