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

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

Definition at line 242 of file smart_graph.h.

Public Member Functions

Edge findEdge (Node u, Node v, Edge prev=INVALID)
 Finds an edge between two nodes.

Classes

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


Member Function Documentation

Edge findEdge Node  u,
Node  v,
Edge  prev = INVALID
[inline]
 

Finds an edge from node u to node v.

If prev is INVALID (this is the default value), then it finds the first edge from u to v. Otherwise it looks for the next edge from u to v after prev.

Returns:
The found edge or INVALID if there is no such an edge.
Thus you can iterate through each edge from u to v as it follows.
        for(Edge e=G.findEdge(u,v);e!=INVALID;e=G.findEdge(u,v,e)) {
          ...
        }
Todo:
Possibly it should be a global function.

Definition at line 260 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