Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

SmartGraphBase Class Reference

#include <lemon/smart_graph.h>

List of all members.


Detailed Description

Base of SmartGraph

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.


Member Function Documentation

int maxId Node  = INVALID  )  const [inline]
 

Maximum node ID.

See also:
id(Node)

Definition at line 92 of file smart_graph.h.

int maxId Edge  = INVALID  )  const [inline]
 

Maximum edge ID.

See also:
id(Edge)

Definition at line 97 of file smart_graph.h.

static int id Node  v  )  [inline, static]
 

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.

Returns:
The ID of the node v.

Definition at line 110 of file smart_graph.h.

static int id Edge  e  )  [inline, static]
 

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.

Returns:
The ID of the edge e.

Definition at line 119 of file smart_graph.h.


The documentation for this class was generated from the following file:
Generated on Sat Mar 19 10:58:54 2005 for LEMON by  doxygen 1.4.1