Changeset 2111:ea1fa1bc3f6d in lemon0.x for doc
 Timestamp:
 06/28/06 17:06:24 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2817
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphs.dox
r1638 r2111 2 2 3 3 \page graphs Graphs 4 5 \todo Write a new Graphs page. I think it should be contain the Graph, 6 UGraph and BpUGraph concept. It should be describe the iterators and 7 the basic functions and the differences of the implementations. 4 8 5 9 The primary data structures of LEMON are the graph classes. They all … … 8 12 as incoming and outgoing edges of a given node. 9 13 14 Each graph should meet the \ref lemon::concept::Graph "Graph" concept. 15 This concept does not make it possible to change the graph (i.e. it is 16 not possible to add or delete edges or nodes). Most of the graph 17 algorithms will run on these graphs. 10 18 11 Each graph should meet the12 \ref lemon::concept::StaticGraph "StaticGraph" concept.13 This concept does not14 make it possible to change the graph (i.e. it is not possible to add15 or delete edges or nodes). Most of the graph algorithms will run on16 these graphs.17 18 The graphs meeting the19 \ref lemon::concept::ExtendableGraph "ExtendableGraph"20 concept allow node and21 edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).22 19 23 20 In case of graphs meeting the full feature … … 37 34 \li \ref lemon::FullGraph "FullGraph" 38 35 implements a complete graph. It is a 39 \ref lemon::concept:: StaticGraph "StaticGraph", so you cannot36 \ref lemon::concept::Graph "Graph", so you cannot 40 37 change the number of nodes once it is constructed. It is extremely memory 41 38 efficient: it uses constant amount of memory independently from the number of
Note: See TracChangeset
for help on using the changeset viewer.