FullGraph Class Reference
[Graph Structures]

#include <lemon/full_graph.h>

Inherits GraphExtender< lemon::FullGraphBase >.

Inheritance diagram for FullGraph:

Inheritance graph
[legend]
List of all members.

Detailed Description

This is a simple and fast directed full graph implementation. It is completely static, so you can neither add nor delete either edges or nodes. Thus it conforms to the Graph concept and it also has an important extra feature that its maps are real reference maps.
See also:
concepts::Graph.

FullUGraph

Author:
Alpar Juttner


Public Member Functions

 FullGraph ()
 Constructor.
 FullGraph (int n)
 Constructor.
void resize (int n)
 Resize the graph.
Node operator() (int index) const
 Returns the node with the given index.
int index (const Node &node) const
 Returns the index of the node.
Edge edge (const Node &u, const Node &v) const
 Returns the edge connects the given nodes.
int nodeNum () const
 Number of nodes.
int edgeNum () const
 Number of edges.


Member Function Documentation

void resize ( int  n  )  [inline]

Resize the graph. The function will fully destroy and build the graph. This cause that the maps of the graph will reallocated automatically and the previous values will be lost.

Node operator() ( int  index  )  const [inline]

Returns the node with the given index. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to nodeNum()-1 and the index of the node can accessed by the index() member.

int index ( const Node &  node  )  const [inline]

Returns the index of the node. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to nodeNum()-1 and the index of the node can accessed by the index() member.

Edge edge ( const Node &  u,
const Node &  v 
) const [inline]

Returns the edge connects the given nodes.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:50:19 2006 for LEMON by  doxygen 1.5.1