#include <full_graph.h>
Don't we need SymEdgeMap?
Definition at line 51 of file full_graph.h.
Public Member Functions | |
FullGraph (int n) | |
Creates a full graph with n nodes. | |
int | nodeNum () const |
Number of nodes. | |
int | edgeNum () const |
Number of edges. | |
int | maxNodeId () const |
Maximum node ID. | |
int | maxEdgeId () const |
Maximum edge ID. | |
Edge | findEdge (Node u, Node v, Edge prev=INVALID) |
Finds an edge between two nodes. | |
Static Public Member Functions | |
int | id (Node v) |
Node ID. | |
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 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.
|
|
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.
|
|
Finds an edge from node
If
References lemon::INVALID. |