Class for the representation of nodes.
More...
#include <ogdf/basic/Graph_d.h>
Class for the representation of nodes.
Definition at line 177 of file Graph_d.h.
◆ NodeElement()
ogdf::NodeElement::NodeElement |
( |
int |
id | ) |
|
|
inlineprivate |
Constructs a node element with index id
.
Definition at line 202 of file Graph_d.h.
◆ adjEdges()
void ogdf::NodeElement::adjEdges |
( |
EDGELIST & |
edgeList | ) |
const |
|
inline |
Returns a list with all edges incident to this node.
Note that each self-loop of this node is contained twice in the list.
- Template Parameters
-
EDGELIST | is the type of edge list, which is returned. |
- Parameters
-
edgeList | is assigned the list of all edges incident to this node (including incoming and outcoming edges). |
Definition at line 256 of file Graph_d.h.
◆ allAdjEntries()
void ogdf::NodeElement::allAdjEntries |
( |
ADJLIST & |
adjList | ) |
const |
|
inline |
Returns a list with all adjacency entries of this node.
- Template Parameters
-
ADJLIST | is the type of adjacency entry list, which is returned. |
- Parameters
-
adjList | is assigned the list of all adjacency entries of this node. |
Definition at line 240 of file Graph_d.h.
◆ compare()
Standard Comparer.
Definition at line 285 of file Graph_d.h.
◆ degree()
int ogdf::NodeElement::degree |
( |
| ) |
const |
|
inline |
Returns the degree of the node (indegree + outdegree).
Definition at line 220 of file Graph_d.h.
◆ firstAdj()
adjEntry ogdf::NodeElement::firstAdj |
( |
| ) |
const |
|
inline |
Returns the first entry in the adjaceny list.
Definition at line 223 of file Graph_d.h.
◆ indeg()
int ogdf::NodeElement::indeg |
( |
| ) |
const |
|
inline |
Returns the indegree of the node.
Definition at line 214 of file Graph_d.h.
◆ index()
int ogdf::NodeElement::index |
( |
| ) |
const |
|
inline |
Returns the (unique) node index.
Definition at line 211 of file Graph_d.h.
◆ inEdges()
void ogdf::NodeElement::inEdges |
( |
EDGELIST & |
edgeList | ) |
const |
Returns a list with all incoming edges of this node.
- Template Parameters
-
EDGELIST | is the type of edge list, which is returned. |
- Parameters
-
edgeList | is assigned the list of all incoming edges incident to this node. |
Definition at line 438 of file Graph_d.h.
◆ lastAdj()
adjEntry ogdf::NodeElement::lastAdj |
( |
| ) |
const |
|
inline |
Returns the last entry in the adjacency list.
Definition at line 226 of file Graph_d.h.
◆ outdeg()
int ogdf::NodeElement::outdeg |
( |
| ) |
const |
|
inline |
Returns the outdegree of the node.
Definition at line 217 of file Graph_d.h.
◆ outEdges()
void ogdf::NodeElement::outEdges |
( |
EDGELIST & |
edgeList | ) |
const |
Returns a list with all outgoing edges of this node.
- Template Parameters
-
EDGELIST | is the type of edge list, which is returned. |
- Parameters
-
edgeList | is assigned the list of all outgoing edges incident to this node. |
Definition at line 449 of file Graph_d.h.
◆ pred()
node ogdf::NodeElement::pred |
( |
| ) |
const |
|
inline |
Returns the predecessor in the list of all nodes.
Definition at line 232 of file Graph_d.h.
◆ succ()
node ogdf::NodeElement::succ |
( |
| ) |
const |
|
inline |
Returns the successor in the list of all nodes.
Definition at line 229 of file Graph_d.h.
◆ Graph
◆ internal::GraphList< NodeElement >
◆ adjEntries
The container containing all entries in the adjacency list of this node.
Definition at line 208 of file Graph_d.h.
◆ m_id
int ogdf::NodeElement::m_id |
|
private |
The (unique) index of the node.
Definition at line 184 of file Graph_d.h.
◆ m_indeg
int ogdf::NodeElement::m_indeg |
|
private |
The indegree of the node.
Definition at line 182 of file Graph_d.h.
◆ m_outdeg
int ogdf::NodeElement::m_outdeg |
|
private |
The outdegree of the node.
Definition at line 183 of file Graph_d.h.
The documentation for this class was generated from the following file: