#include <lemon/smart_graph.h>
Definition at line 45 of file smart_graph.h.
Public Member Functions | |
int | nodeNum () const |
Number of nodes. | |
int | edgeNum () const |
Number of edges. | |
int | maxId (Node=INVALID) const |
Maximum node ID. | |
int | maxId (Edge=INVALID) const |
Maximum edge ID. | |
Static Public Member Functions | |
static int | id (Node v) |
Node ID. | |
static int | id (Edge e) |
Edge ID. |
|
Maximum node ID.
Definition at line 92 of file smart_graph.h. |
|
Maximum edge ID.
Definition at line 97 of file smart_graph.h. |
|
The ID of a valid Node is a nonnegative integer not greater than maxNodeId(). The range of the ID's is not surely continuous and the greatest node ID can be actually less then maxNodeId(). The ID of the INVALID node is -1.
Definition at line 110 of file smart_graph.h. |
|
The ID of a valid Edge is a nonnegative integer not greater than maxEdgeId(). The range of the ID's is not surely continuous and the greatest edge ID can be actually less then maxEdgeId(). The ID of the INVALID edge is -1.
Definition at line 119 of file smart_graph.h. |