Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
CrossingStructure.h
Go to the documentation of this file.
1
32#pragma once
33
35
36namespace ogdf {
37namespace embedder {
38
65
66}
67}
Declaration of class PlanRepLight.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Class for the representation of edges.
Definition Graph_d.h:300
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:254
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:57
Singly linked lists.
Definition SList.h:179
const SListPure< int > & crossings(edge e) const
EdgeArray< SListPure< int > > m_crossings
void restore(PlanRep &PG, int cc)
void init(GraphCopy &PG, int weightedCrossingNumber)
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.