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
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/SList.h>
36
37namespace ogdf {
38class GraphCopy;
39class PlanRep;
40
41namespace embedder {
42
69
70}
71}
Includes declaration of graph class.
Declaration of singly linked lists and iterators.
Class for the representation of edges.
Definition Graph_d.h:364
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:390
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:68
Singly linked lists.
Definition SList.h:191
const SListPure< int > & crossings(edge e) const
EdgeArray< SListPure< int > > m_crossings
void restore(PlanRep &PG, int cc)
void init(GraphCopy &PG, int weightedCrossingNumber)
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717
The namespace for all OGDF objects.