#include <lemon/smart_graph.h>
Detailed Description
This is a simple and fast bipartite undirected graph implementation. It is also quite memory efficient, but at the price that it does not support node and edge deletions. Except from this it conforms to the BpUGraph concept. - See also:
- concept::BpUGraph.
The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:42:39 2006 for LEMON by
1.4.6