Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Hierarchy.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/EdgeArray.h>
35 #include <ogdf/basic/GraphCopy.h>
36 
37 namespace ogdf {
38 
40 
44  friend class LayerBasedUPRLayout;
45 
49 
50 public:
52  Hierarchy() { }
53 
55  Hierarchy(const Graph& G, const NodeArray<int>& rank);
56 
57  // destruction
58  ~Hierarchy() { }
59 
60  void createEmpty(const Graph& G);
61  void initByNodes(const List<node>& nodes, EdgeArray<edge>& eCopy, const NodeArray<int>& rank);
62 
64  operator const GraphCopy&() const { return m_GC; }
65 
67  int rank(node v) const { return m_rank[v]; }
68 
69  int maxRank() const { return m_size.high(); }
70 
71  int size(int i) const { return m_size[i]; }
72 
73  bool isLongEdgeDummy(node v) const { return m_GC.isDummy(v) && v->outdeg() == 1; }
74 
75 private:
76  void doInit(const NodeArray<int>& rank);
77 };
78 
79 }
ogdf::Hierarchy::size
int size(int i) const
Definition: Hierarchy.h:71
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
ogdf::GraphCopyBase::isDummy
bool isDummy(node v) const
Returns true iff v has no corresponding node in the original graph.
Definition: GraphCopy.h:166
ogdf::Hierarchy::Hierarchy
Hierarchy()
Creates an empty hierarchy.
Definition: Hierarchy.h:52
ogdf::Array::high
INDEX high() const
Returns the maximal array index.
Definition: Array.h:294
ogdf::Hierarchy::m_size
Array< int > m_size
Definition: Hierarchy.h:48
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:384
ogdf::Hierarchy
Representation of proper hierarchies used by Sugiyama-layout.
Definition: Hierarchy.h:43
ogdf::Hierarchy::~Hierarchy
~Hierarchy()
Definition: Hierarchy.h:58
ogdf::LayerBasedUPRLayout
Definition: LayerBasedUPRLayout.h:101
ogdf::Hierarchy::m_rank
NodeArray< int > m_rank
The rank (level) of a node.
Definition: Hierarchy.h:47
ogdf::NodeElement::outdeg
int outdeg() const
Returns the outdegree of the node.
Definition: Graph_d.h:273
ogdf::Array< int >
EdgeArray.h
Declaration and implementation of EdgeArray class.
GraphCopy.h
Declaration of graph copy classes.
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:42
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:651
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::Hierarchy::m_GC
GraphCopy m_GC
The graph copy representing the topology of the proper hierarchy.
Definition: Hierarchy.h:46
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::Hierarchy::isLongEdgeDummy
bool isLongEdgeDummy(node v) const
Definition: Hierarchy.h:73
ogdf::Hierarchy::rank
int rank(node v) const
Returns the rank (level) of node v.
Definition: Hierarchy.h:67
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:233
ogdf::Hierarchy::maxRank
int maxRank() const
Definition: Hierarchy.h:69
ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition: Graph_d.h:709