SmartGraph Class Reference
[Graph Structures]

#include <lemon/smart_graph.h>

List of all members.


Detailed Description

This is a simple and fast graph implementation. It is also quite memory efficient, but at the price that it does support only limited (only stack-like) node and edge deletions. It conforms to the ExtendableGraph concept.
See also:
concept::ExtendableGraph.
Author:
Alpar Juttner


Public Member Functions

Node split (Node n, bool connect=true)
 Split a node.

Classes

class  Snapshot
 Class to make a snapshot of the graph and to restrore to it later. More...


Member Function Documentation

Node split Node  n,
bool  connect = true
[inline]
 

This function splits a node. First a new node is added to the graph, then the source of each outgoing edge of n is moved to this new node. If connect is true (this is the default value), then a new edge from n to the newly created node is also added.

Returns:
The newly created node.
Note:
The Edges referencing a moved edge remain valid. However InEdge's and OutEdge's may be invalidated.
Warning:
This functionality cannot be used together with the Snapshot feature.
Todo:
It could be implemented in a bit faster way.


The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:42:39 2006 for LEMON by  doxygen 1.4.6