Changeset 2260:4274224f8a7d in lemon0.x for doc/graphs.dox
 Timestamp:
 10/24/06 19:19:16 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3016
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphs.dox
r2116 r2260 12 12 as incoming and outgoing edges of a given node. 13 13 14 Each graph should meet the \ref lemon::concept ::Graph "Graph" concept.14 Each graph should meet the \ref lemon::concepts::Graph "Graph" concept. 15 15 This concept does not make it possible to change the graph (i.e. it is 16 16 not possible to add or delete edges or nodes). Most of the graph … … 19 19 20 20 In case of graphs meeting the full feature 21 \ref lemon::concept ::ErasableGraph "ErasableGraph"21 \ref lemon::concepts::ErasableGraph "ErasableGraph" 22 22 concept 23 23 you can also erase individual edges and nodes in arbitrary order. … … 25 25 The implemented graph structures are the following. 26 26 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets 27 the \ref lemon::concept ::ErasableGraph "ErasableGraph" concept27 the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept 28 28 and it also has some convenient extra features. 29 29 \li \ref lemon::SmartGraph "SmartGraph" is a more memory 30 30 efficient version of \ref lemon::ListGraph "ListGraph". The 31 31 price of this is that it only meets the 32 \ref lemon::concept ::ExtendableGraph "ExtendableGraph" concept,32 \ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept, 33 33 so you cannot delete individual edges or nodes. 34 34 \li \ref lemon::FullGraph "FullGraph" 35 35 implements a complete graph. It is a 36 \ref lemon::concept ::Graph "Graph", so you cannot36 \ref lemon::concepts::Graph "Graph", so you cannot 37 37 change the number of nodes once it is constructed. It is extremely memory 38 38 efficient: it uses constant amount of memory independently from the number of
Note: See TracChangeset
for help on using the changeset viewer.