# OpenGraph DrawingFramework

v.2012.07

Class for adjacency list elements. More...

#include <ogdf/basic/Graph_d.h>

List of all members.

## Public Member Functions

Returns the clockwise predecessor in face. Use faceCycleSucc instead!
Returns the clockwise successor in face. Use faceCycleSucc instead!
Returns the counter-clockwise predecessor in face.
Returns the counter-clockwise successor in face.
Returns the cyclic predecessor in the adjacency list.
Returns the cyclic successor in the adjacency list.
Returns the cyclic predecessor in face.
Returns the cyclic successor in face.
int index () const
Returns the index of this adjacency element.
operator edge () const
Conversion to edge.
Returns the predecessor in the adjacency list.
Returns the successor in the adjacency list.
edge theEdge () const
Returns the edge associated with this adjacency entry.
node theNode () const
Returns the node whose adjacency list contains this element.
Returns the corresponding adjacency element associated with the same edge.
node twinNode () const
Returns the associated node of the corresponding adjacency entry (shorthand for twin()->theNode()).

## Private Member Functions

Constructs an adjacency element for a given node.
Constructs an adjacency entry for a given edge and index.

## Private Attributes

edge m_edge
The associated edge.
int m_id
The (unique) index of the adjacency entry.
node m_node
The node whose adjacency list contains this entry.
The corresponding adjacency entry (same edge)

## Friends

class Graph
class GraphListBase

## Detailed Description

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

Definition at line 375 of file Graph_d.h.

## Constructor & Destructor Documentation

inlineprivate

Constructs an adjacency element for a given node.

Definition at line 386 of file Graph_d.h.

inlineprivate

Constructs an adjacency entry for a given edge and index.

Definition at line 388 of file Graph_d.h.

## Member Function Documentation

inline

Returns the clockwise predecessor in face. Use faceCycleSucc instead!

Definition at line 413 of file Graph_d.h.

inline

Returns the clockwise successor in face. Use faceCycleSucc instead!

Definition at line 411 of file Graph_d.h.

inline

Returns the counter-clockwise predecessor in face.

Definition at line 417 of file Graph_d.h.

inline

Returns the counter-clockwise successor in face.

Definition at line 415 of file Graph_d.h.

inline

Returns the cyclic predecessor in the adjacency list.

Definition at line 510 of file Graph_d.h.

inline

Returns the cyclic successor in the adjacency list.

Definition at line 505 of file Graph_d.h.

inline

Returns the cyclic predecessor in face.

Definition at line 423 of file Graph_d.h.

inline

Returns the cyclic successor in face.

Definition at line 421 of file Graph_d.h.

inline

Returns the index of this adjacency element.

Definition at line 405 of file Graph_d.h.

inline

Conversion to edge.

Definition at line 394 of file Graph_d.h.

inline

Returns the predecessor in the adjacency list.

Definition at line 429 of file Graph_d.h.

inline

Returns the successor in the adjacency list.

Definition at line 427 of file Graph_d.h.

inline

Returns the edge associated with this adjacency entry.

Definition at line 392 of file Graph_d.h.

inline

Returns the node whose adjacency list contains this element.

Definition at line 396 of file Graph_d.h.

inline

Returns the corresponding adjacency element associated with the same edge.

Definition at line 399 of file Graph_d.h.

inline

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

Definition at line 402 of file Graph_d.h.

## Friends And Related Function Documentation

 friend class Graph
friend

Reimplemented from ogdf::GraphElement.

Definition at line 376 of file Graph_d.h.

friend

Definition at line 378 of file Graph_d.h.

 friend class GraphListBase
friend

Reimplemented from ogdf::GraphElement.

Definition at line 377 of file Graph_d.h.

## Member Data Documentation

private

The associated edge.

Definition at line 381 of file Graph_d.h.

private

The (unique) index of the adjacency entry.

Definition at line 383 of file Graph_d.h.

private

The node whose adjacency list contains this entry.

Definition at line 382 of file Graph_d.h.