#include <list_graph.h>
GG | The type of the graph which shares its node set with this class. Its interface must conform to the StaticGraph concept. |
Definition at line 780 of file list_graph.h.
Public Member Functions | |
EdgeSet (NodeGraphType &_G) | |
Constructor. | |
EdgeSet (const EdgeSet &_g) | |
Copy constructor. | |
int | nodeNum () const |
Number of nodes. | |
int | edgeNum () const |
Number of edges. | |
int | maxNodeId () const |
Maximum node ID. | |
int | maxEdgeId () const |
Maximum edge ID. | |
int | id (Node v) |
Node ID. | |
Node | addNode () |
Adds a new node to the graph. | |
Edge | findEdge (Node u, Node v, Edge prev=INVALID) |
Finds an edge between two nodes. | |
void | clear () |
Clear all edges. (Doesn't clear the nodes!). | |
Static Public Member Functions | |
int | id (Edge e) |
Edge ID. |
|
Construates a new graph based on the nodeset of an existing one.
|
|
Makes a copy of an EdgeSet. It will be based on the same graph. Definition at line 885 of file list_graph.h. |
|
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
|