#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph:
It can be used for checking the interface compatibility, or it can serve as a skeleton of a new symmetric graph structure.
Also, you will find here the full documentation of a certain graph feature, the documentation of a real symmetric graph imlementation like SymListGraph or lemon::SymSmartGraph will just refer to this structure.
Definition at line 49 of file sym_graph.h.
Public Member Functions | |
StaticSymGraph () | |
Defalult constructor. | |
NodeIt & | first (NodeIt &i) const |
First node of the graph. | |
InEdgeIt & | first (InEdgeIt &i, Node) const |
The first incoming edge. | |
OutEdgeIt & | first (OutEdgeIt &i, Node) const |
The first outgoing edge. | |
EdgeIt & | first (EdgeIt &i) const |
The first edge of the Graph. | |
SymEdgeIt & | first (SymEdgeIt &i) const |
The first symmetric edge of the Graph. | |
Node | target (Edge) const |
Gives back the target node of an edge. | |
Node | source (Edge) const |
Gives back the source node of an edge. | |
Node | target (SymEdge) const |
Gives back the first node of an symmetric edge. | |
Node | source (SymEdge) const |
Gives back the second node of an symmetric edge. | |
int | id (const Node &) const |
Gives back the id of a node. | |
int | id (const Edge &) const |
Gives back the id of an edge. | |
int | id (const SymEdge &) const |
int | nodeNum () const |
| |
int | edgeNum () const |
| |
int | symEdgeNum () const |
Edge | forward (SymEdge) const |
Gives back the forward directed edge of the symmetric edge. | |
Edge | backward (SymEdge) const |
Gives back the backward directed edge of the symmetric edge. | |
Edge | opposite (Edge) const |
Gives back the opposite of the edge. | |
Classes | |
class | Edge |
The base type of the edge iterators. More... | |
class | EdgeIt |
This iterator goes through each edge. More... | |
class | EdgeMap |
Reference map of the edges to type T . More... | |
class | InEdgeIt |
This iterator goes trough the incoming edges of a node. More... | |
class | Node |
Copy consructor. More... | |
class | NodeIt |
This iterator goes through each node. More... | |
class | NodeMap |
class | OutEdgeIt |
This iterator goes trough the outgoing edges of a node. More... | |
class | SymEdge |
The base type of the symmetric edge iterators. More... | |
class | SymEdgeIt |
This iterator goes through each symmetric edge. More... | |
class | SymEdgeMap |
Reference map of the edges to type T . More... |
|
Defalult constructor. Definition at line 56 of file sym_graph.h. |
|
Definition at line 430 of file sym_graph.h. |
|
The first incoming edge. Definition at line 436 of file sym_graph.h. |
|
The first outgoing edge. Definition at line 441 of file sym_graph.h. |
|
The first edge of the Graph. Definition at line 446 of file sym_graph.h. |
|
The first symmetric edge of the Graph. Definition at line 451 of file sym_graph.h. |
|
Gives back the target node of an edge. Definition at line 457 of file sym_graph.h. |
|
Gives back the source node of an edge. Definition at line 462 of file sym_graph.h. |
|
Gives back the first node of an symmetric edge. Definition at line 468 of file sym_graph.h. |
|
Gives back the second node of an symmetric edge. Definition at line 473 of file sym_graph.h. |
|
Definition at line 479 of file sym_graph.h. |
|
Definition at line 485 of file sym_graph.h. |
|
Definition at line 490 of file sym_graph.h. |
|
Definition at line 496 of file sym_graph.h. |
|
Definition at line 501 of file sym_graph.h. |
|
Definition at line 505 of file sym_graph.h. |