Changeset 2111:ea1fa1bc3f6d in lemon-0.x for doc/graphs.dox

Timestamp:

06/28/06 17:06:24 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2817

Message:

Removing concepts for extendable and erasable graphs
Renaming StaticGraph? to Graph

File:

• doc/graphs.dox (modified) (3 diffs)

doc/graphs.dox

@@ -2 +2 @@
 
 \page graphs Graphs
+
+\todo Write a new Graphs page. I think it should be contain the Graph,
+UGraph and BpUGraph concept. It should be describe the iterators and
+the basic functions and the differences of the implementations.
 
 The primary data structures of LEMON are the graph classes. They all
@@ -8 +12 @@
 as  incoming and outgoing edges of a given node. 
 
+Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
+This concept does not make it possible to change the graph (i.e. it is
+not possible to add or delete edges or nodes). Most of the graph
+algorithms will run on these graphs.
 
-Each graph should meet the
-\ref lemon::concept::StaticGraph "StaticGraph" concept.
-This concept does not
-make it possible to change the graph (i.e. it is not possible to add
-or delete edges or nodes). Most of the graph algorithms will run on
-these graphs.
-
-The graphs meeting the
-\ref lemon::concept::ExtendableGraph "ExtendableGraph"
-concept allow node and
-edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).
 
 In case of graphs meeting the full feature
@@ -37 +34 @@
 \li \ref lemon::FullGraph "FullGraph"
 implements a complete graph. It is a
-\ref lemon::concept::StaticGraph "StaticGraph", so you cannot
+\ref lemon::concept::Graph "Graph", so you cannot
 change the number of nodes once it is constructed. It is extremely memory
 efficient: it uses constant amount of memory independently from the number of