Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

CrossingsBucket.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph.h>
35 
36 namespace ogdf {
37 namespace embedding_inserter {
38 
40 template<typename PLANREP>
41 class CrossingsBucket : public BucketFunc<edge> {
42  const PLANREP* m_pPG;
43 
44 public:
45  explicit CrossingsBucket(const PLANREP* pPG) : m_pPG(pPG) { }
46 
47  int getBucket(const edge& e) override { return -m_pPG->chain(e).size(); }
48 };
49 
50 }
51 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::BucketFunc
Abstract base class for bucket functions.
Definition: basic.h:255
ogdf::embedding_inserter::CrossingsBucket
Bucket function for sorting edges by decreasing number of crossings.
Definition: CrossingsBucket.h:41
ogdf::embedding_inserter::CrossingsBucket::m_pPG
const PLANREP * m_pPG
Definition: CrossingsBucket.h:42
ogdf::EdgeElement
Class for the representation of edges.
Definition: Graph_d.h:356
ogdf::embedding_inserter::CrossingsBucket::CrossingsBucket
CrossingsBucket(const PLANREP *pPG)
Definition: CrossingsBucket.h:45
ogdf::embedding_inserter::CrossingsBucket::getBucket
int getBucket(const edge &e) override
Returns the bucket of x.
Definition: CrossingsBucket.h:47