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

ExtendableUndirGraph Class Reference
[Graph Structure Concepts]

#include <lemon/concept/undir_graph.h>

Inherits UndirGraph.

Inherited by ErasableUndirGraph.

Inheritance diagram for ExtendableUndirGraph:

Inheritance graph
[legend]
List of all members.

Detailed Description

This class provides everything that UndirGraph does. Additionally it enables building graphs from scratch.


Public Member Functions

Node addNode ()
 Add a new node to the graph.
UndirEdge addEdge (const Node &from, const Node &to)
 Add a new undirected edge to the graph.
void clear ()
 Resets the graph.


Member Function Documentation

Node addNode  ) 
 

Add a new node to the graph.

Returns:
the new node.

UndirEdge addEdge const Node &  from,
const Node &  to
 

Add a new undirected edge to the graph.

Returns:
the new edge.

void clear  )  [inline]
 

This function deletes all undirected edges and nodes of the graph. It also frees the memory allocated to store them.


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:17:13 2005 for LEMON by  doxygen 1.4.4