Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

VertexOrder.h File Reference

Computes an vertex order based on the number of crossings in a given (straight-line) drawing. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <utility>
#include <vector>

Go to the source code of this file.

Classes

class  ogdf::CrossingVertexOrder
 

Namespaces

 ogdf
 The namespace for all OGDF objects.
 

Enumerations

enum  ogdf::MeasureEnum { ogdf::MeasureEnum::zero, ogdf::MeasureEnum::log, ogdf::MeasureEnum::sum, ogdf::MeasureEnum::squared }
 
enum  ogdf::OrderEnum { ogdf::OrderEnum::asc, ogdf::OrderEnum::desc, ogdf::OrderEnum::rnd }
 

Detailed Description

Computes an vertex order based on the number of crossings in a given (straight-line) drawing.

Author
Marcel Radermacher
Precondition
Requires CGAL! See README.md in this folder.
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 VertexOrder.h.