|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
41 namespace fast_multipole_embedder {
61 inline uint32_t
twinNode(uint32_t index)
const {
63 return a == index ?
b :
a;
74 void pushBackEdge(uint32_t a, uint32_t b, std::function<EdgeAdjInfo&(uint32_t)> edgeInform,
75 std::function<NodeAdjInfo&(uint32_t)> nodeInform,
int e_index);
The namespace for all OGDF objects.
uint32_t nextEdgeAdjIndex(uint32_t index) const
Returns the index of the next pair of index.
uint32_t twinNode(uint32_t index) const
Returns the other node (not index).
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
uint32_t b_next
Next pair in the chain of the second node.
Information about incident edges (16 bytes).
uint32_t a
First node of the pair.
uint32_t firstEntry
The first pair in the edges chain.
uint32_t a_next
Next pair in the chain of the first node.
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.
uint32_t lastEntry
The last pair in the edges chain.
uint32_t degree
Total count of pairs where is either the first or second node.
Basic declarations, included by all source files.
Information about an edge (16 bytes).
uint32_t unused
Not used yet.
uint32_t b
Second node of the pair.