My Project
|
This class describes the interface of idable undirected graphs. It extends IDableDigraphComponent with the core ID functions of undirected graphs. The ids of the items must be unique and immutable. This concept is part of the Graph concept.
#include <lemon/concepts/graph_components.h>
Public Member Functions | |
int | id (const Edge &) const |
Return a unique integer id for the given edge. More... | |
Edge | edgeFromId (int) const |
Return the edge by its unique id. More... | |
int | maxEdgeId () const |
Return an integer greater or equal to the maximum edge id. More... | |
![]() | |
int | id (const Node &) const |
Return a unique integer id for the given node. More... | |
int | id (const Arc &) const |
Return a unique integer id for the given arc. More... | |
Node | nodeFromId (int) const |
Return the node by its unique id. More... | |
Arc | arcFromId (int) const |
Return the arc by its unique id. More... | |
int | maxNodeId () const |
Return an integer greater or equal to the maximum node id. More... | |
int | maxArcId () const |
Return an integer greater or equal to the maximum arc id. More... | |
![]() | |
Node | u (const Edge &) const |
Return one end node of an edge. More... | |
Node | v (const Edge &) const |
Return the other end node of an edge. More... | |
Arc | direct (const Edge &, bool) const |
Return a directed arc related to an edge. More... | |
Arc | direct (const Edge &, const Node &) const |
Return a directed arc related to an edge. More... | |
bool | direction (const Arc &) const |
Return the direction of the arc. More... | |
Arc | oppositeArc (const Arc &) const |
Return the opposite arc. More... | |
![]() | |
Node | source (const Arc &) const |
Return the source node of an arc. More... | |
Node | target (const Arc &) const |
Return the target node of an arc. More... | |
Node | oppositeNode (const Node &, const Arc &) const |
Return the opposite node on the given arc. More... | |
Additional Inherited Members | |
![]() | |
typedef GraphItem< 'n'> | Node |
Node class of the digraph. More... | |
typedef GraphItem< 'a'> | Arc |
Arc class of the digraph. More... | |
|
inline |
This function returns a unique integer id for the given edge.
|
inline |
This function returns the edge by its unique id. If the graph does not contain an edge with the given id, then the result of the function is undefined.
|
inline |
This function returns an integer greater or equal to the maximum edge id.