Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

StressMinimization.h File Reference

Declaration of stress minimized layout based on majorization. It can be applied to connected as well as unconnected graphs. If the graph is disconnected either the infinite distances will be replaced by the average edge costs times sqrt(n) or the components will be processed separately. More...

Go to the source code of this file.

Classes

class  ogdf::StressMinimization
 Energy-based layout using stress minimization. More...
 

Namespaces

 ogdf
 The namespace for all OGDF objects.
 

Detailed Description

Declaration of stress minimized layout based on majorization. It can be applied to connected as well as unconnected graphs. If the graph is disconnected either the infinite distances will be replaced by the average edge costs times sqrt(n) or the components will be processed separately.

Author
Mark Ortmann, University of Konstanz
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 StressMinimization.h.