Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

CrossingStructure.h
Go to the documentation of this file.
1 
32 #pragma once
33 
35 
36 namespace ogdf {
37 namespace embedder {
38 
40 public:
42 
43  void init(GraphCopy& PG, int weightedCrossingNumber);
44 
52  void restore(PlanRep& PG, int cc);
53 
54  int numberOfCrossings() const { return m_numCrossings; }
55 
57 
58  const SListPure<int>& crossings(edge e) const { return m_crossings[e]; }
59 
60 private:
64 };
65 
66 }
67 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::PlanRep
Planarized representations (of a connected component) of a graph.
Definition: PlanRep.h:57
ogdf::embedder::CrossingStructure
Definition: CrossingStructure.h:39
ogdf::embedder::CrossingStructure::m_crossings
EdgeArray< SListPure< int > > m_crossings
Definition: CrossingStructure.h:63
ogdf::embedder::CrossingStructure::numberOfCrossings
int numberOfCrossings() const
Definition: CrossingStructure.h:54
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:384
ogdf::embedder::CrossingStructure::CrossingStructure
CrossingStructure()
Definition: CrossingStructure.h:41
ogdf::SListPure< int >
ogdf::embedder::CrossingStructure::crossings
const SListPure< int > & crossings(edge e) const
Definition: CrossingStructure.h:58
ogdf::embedder::CrossingStructure::m_weightedCrossingNumber
int m_weightedCrossingNumber
Definition: CrossingStructure.h:62
ogdf::embedder::CrossingStructure::weightedCrossingNumber
int weightedCrossingNumber() const
Definition: CrossingStructure.h:56
PlanRepLight.h
Declaration of class PlanRepLight.
ogdf::embedder::CrossingStructure::restore
void restore(PlanRep &PG, int cc)
ogdf::EdgeElement
Class for the representation of edges.
Definition: Graph_d.h:356
ogdf::embedder::CrossingStructure::init
void init(GraphCopy &PG, int weightedCrossingNumber)
ogdf::embedder::CrossingStructure::m_numCrossings
int m_numCrossings
Definition: CrossingStructure.h:61
ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition: Graph_d.h:709