#include <lemon/smart_graph.h>
Public Member Functions | |
int | nodeNum () const |
Number of nodes. | |
int | edgeNum () const |
Number of edges. | |
int | maxId (Node) const |
Maximum node ID. | |
int | maxId (Edge) 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.
|
|
Maximum edge ID.
|
|
The ID of a valid Node is a nonnegative integer not greater than maxId(Node). The range of the ID's is not surely continuous and the greatest node ID can be actually less then maxId(Node). The ID of the INVALID node is -1.
|
|
The ID of a valid Edge is a nonnegative integer not greater than maxId(Edge). The range of the ID's is not surely continuous and the greatest edge ID can be actually less then maxId(Edge). The ID of the INVALID edge is -1.
|