# OpenGraph DrawingFramework

v. 2022.02 (Dogwood)

Class for adjacency list elements. More...

#include <ogdf/basic/Graph_d.h>

## Public Member Functions

Returns the clockwise predecessor in face. Use faceCycleSucc instead! More...

Returns the clockwise successor in face. Use faceCycleSucc instead! More...

Returns the counter-clockwise predecessor in face. More...

Returns the counter-clockwise successor in face. More...

Returns the cyclic predecessor in the adjacency list. More...

Returns the cyclic successor in the adjacency list. More...

Returns the cyclic predecessor in face. More...

Returns the cyclic successor in face. More...

int index () const
Returns the index of this adjacency element. More...

Returns whether this adjacency entry lies between adjBefore and adjAfter in clockwise rotation. More...

bool isSource () const
Returns true iff this is the source adjacency entry of the corresponding edge. More...

operator edge () const
Conversion to edge. More...

operator node () const
Casts to the node whose adjacency list contains this element. More...

Returns the predecessor in the adjacency list. More...

Returns the successor in the adjacency list. More...

edge theEdge () const
Returns the edge associated with this adjacency entry. More...

node theNode () const
Returns the node whose adjacency list contains this element. More...

Returns the corresponding adjacency element associated with the same edge. More...

node twinNode () const
Returns the associated node of the corresponding adjacency entry (shorthand for twin()->theNode()). More...

## Static Public Member Functions

Standard Comparer. More...

## Private Member Functions

Constructs an adjacency entry for a given edge and index. More...

Constructs an adjacency element for a given node. More...

## Private Attributes

edge m_edge
The associated edge. More...

int m_id
The (unique) index of the adjacency entry. More...

node m_node
The node whose adjacency list contains this entry. More...

The corresponding adjacency entry (same edge) More...

Private Attributes inherited from ogdf::internal::GraphElement
GraphElementm_next = nullptr
The successor in the list. More...

GraphElementm_prev = nullptr
The predecessor in the list. More...

## Friends

class Graph

class internal::GraphListBase

## Detailed Description

Adjacency list elements represent the occurrence of an edges in the adjacency list of a node.

Definition at line 79 of file Graph_d.h.

## Constructor & Destructor Documentation

inlineexplicitprivate

Constructs an adjacency element for a given node.

Definition at line 90 of file Graph_d.h.

inlineprivate

Constructs an adjacency entry for a given edge and index.

Definition at line 92 of file Graph_d.h.

## ◆ clockwiseFacePred()

inline

Returns the clockwise predecessor in face. Use faceCycleSucc instead!

Definition at line 134 of file Graph_d.h.

## ◆ clockwiseFaceSucc()

inline

Returns the clockwise successor in face. Use faceCycleSucc instead!

Definition at line 132 of file Graph_d.h.

## ◆ compare()

inlinestatic

Standard Comparer.

Definition at line 162 of file Graph_d.h.

## ◆ counterClockwiseFacePred()

inline

Returns the counter-clockwise predecessor in face.

Definition at line 138 of file Graph_d.h.

## ◆ counterClockwiseFaceSucc()

inline

Returns the counter-clockwise successor in face.

Definition at line 136 of file Graph_d.h.

## ◆ cyclicPred()

inline

Returns the cyclic predecessor in the adjacency list.

Definition at line 284 of file Graph_d.h.

## ◆ cyclicSucc()

inline

Returns the cyclic successor in the adjacency list.

Definition at line 279 of file Graph_d.h.

## ◆ faceCyclePred()

inline

Returns the cyclic predecessor in face.

Definition at line 144 of file Graph_d.h.

## ◆ faceCycleSucc()

inline

Returns the cyclic successor in face.

Definition at line 142 of file Graph_d.h.

## ◆ index()

inline

Returns the index of this adjacency element.

Definition at line 111 of file Graph_d.h.

## ◆ isBetween()

inline

Returns whether this adjacency entry lies between adjBefore and adjAfter in clockwise rotation.

Note that this operation takes time linear in the degree of the node.

Parameters
 adjBefore First adjacency entry. Must be at the same node as this. adjAfter Last adjacency entry. Must be at the same node as this.
Returns
true iff this adjacency entry is in between

Definition at line 403 of file Graph_d.h.

## ◆ isSource()

inline

Returns true iff this is the source adjacency entry of the corresponding edge.

Definition at line 399 of file Graph_d.h.

## ◆ operator edge()

inline

Conversion to edge.

Definition at line 98 of file Graph_d.h.

## ◆ operator node()

inline

Casts to the node whose adjacency list contains this element.

Definition at line 102 of file Graph_d.h.

## ◆ pred()

inline

Returns the predecessor in the adjacency list.

Definition at line 150 of file Graph_d.h.

## ◆ succ()

inline

Returns the successor in the adjacency list.

Definition at line 148 of file Graph_d.h.

## ◆ theEdge()

inline

Returns the edge associated with this adjacency entry.

Definition at line 96 of file Graph_d.h.

## ◆ theNode()

inline

Returns the node whose adjacency list contains this element.

Definition at line 100 of file Graph_d.h.

## ◆ twin()

inline

Returns the corresponding adjacency element associated with the same edge.

Definition at line 105 of file Graph_d.h.

## ◆ twinNode()

inline

Returns the associated node of the corresponding adjacency entry (shorthand for twin()->theNode()).

Definition at line 108 of file Graph_d.h.

## ◆ Graph

 friend class Graph
friend

Definition at line 80 of file Graph_d.h.

friend

Definition at line 82 of file Graph_d.h.

## ◆ internal::GraphListBase

 friend class internal::GraphListBase
friend

Definition at line 81 of file Graph_d.h.

## ◆ m_edge

private

The associated edge.

Definition at line 85 of file Graph_d.h.

## ◆ m_id

private

The (unique) index of the adjacency entry.

Definition at line 87 of file Graph_d.h.

## ◆ m_node

private

The node whose adjacency list contains this entry.

Definition at line 86 of file Graph_d.h.