Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
EdgeChain.h
Go to the documentation of this file.
1
33#pragma once
34
35#include <ogdf/basic/basic.h>
36
37#include <functional>
38
39namespace ogdf {
40namespace fast_multipole_embedder {
41
50
53public:
58
60 inline uint32_t twinNode(uint32_t index) const {
61 OGDF_ASSERT(a == index || b == index);
62 return a == index ? b : a;
63 }
64
66 inline uint32_t nextEdgeAdjIndex(uint32_t index) const {
67 OGDF_ASSERT(a == index || b == index);
68 return a == index ? a_next : b_next;
69 }
70};
71
74 std::function<NodeAdjInfo&(uint32_t)> nodeInform, int e_index);
75
76}
77}
Basic declarations, included by all source files.
Information about an edge (16 bytes).
Definition EdgeChain.h:52
uint32_t a_next
Next pair in the chain of the first node.
Definition EdgeChain.h:56
uint32_t nextEdgeAdjIndex(uint32_t index) const
Returns the index of the next pair of index.
Definition EdgeChain.h:66
uint32_t b
Second node of the pair.
Definition EdgeChain.h:55
uint32_t a
First node of the pair.
Definition EdgeChain.h:54
uint32_t twinNode(uint32_t index) const
Returns the other node (not index).
Definition EdgeChain.h:60
uint32_t b_next
Next pair in the chain of the second node.
Definition EdgeChain.h:57
Information about incident edges (16 bytes).
Definition EdgeChain.h:43
uint32_t lastEntry
The last pair in the edges chain.
Definition EdgeChain.h:47
uint32_t firstEntry
The first pair in the edges chain.
Definition EdgeChain.h:46
uint32_t degree
Total count of pairs where is either the first or second node.
Definition EdgeChain.h:45
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
Definition basic.h:41
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
void pushBackEdge(uint32_t a, uint32_t b, std::function< EdgeAdjInfo &(uint32_t)> edgeInform, std::function< NodeAdjInfo &(uint32_t)> nodeInform, int e_index)
Helper method used by ArrayGraph and WSPD.
The namespace for all OGDF objects.