Changeset 2476:059dcdda37c5 in lemon0.x for doc/graphs.dox
 Timestamp:
 09/27/07 15:04:06 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3315
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphs.dox
r2391 r2476 17 17 */ 18 18 19 namespace lemon { 20 19 21 /*! 20 21 22 \page graphs Graphs 22 23 … … 30 31 as incoming and outgoing edges of a given node. 31 32 32 Each graph should meet the \ref lemon::concepts::Graph "Graph" concept.33 Each graph should meet the \ref concepts::Graph "Graph" concept. 33 34 This concept does not make it possible to change the graph (i.e. it is 34 35 not possible to add or delete edges or nodes). Most of the graph … … 37 38 38 39 In case of graphs meeting the full feature 39 \ref lemon::concepts::ErasableGraph "ErasableGraph" 40 concept 40 \ref concepts::ErasableGraph "ErasableGraph" concept 41 41 you can also erase individual edges and nodes in arbitrary order. 42 42 43 43 The implemented graph structures are the following. 44 \li \ref lemon::ListGraph "ListGraph"is the most versatile graph class. It meets45 the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept44 \li \ref ListGraph is the most versatile graph class. It meets 45 the \ref concepts::ErasableGraph "ErasableGraph" concept 46 46 and it also has some convenient extra features. 47 \li \ref lemon::SmartGraph "SmartGraph" is a more memory 48 efficient version of \ref lemon::ListGraph "ListGraph". The 49 price of this is that it only meets the 50 \ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept, 47 \li \ref SmartGraph is a more memory efficient version of \ref ListGraph. 48 The price of this is that it only meets the 49 \ref concepts::ExtendableGraph "ExtendableGraph" concept, 51 50 so you cannot delete individual edges or nodes. 52 \li \ref lemon::FullGraph "FullGraph"51 \li \ref FullGraph "FullGraph" 53 52 implements a complete graph. It is a 54 \ref lemon::concepts::Graph "Graph", so you cannot53 \ref concepts::Graph "Graph", so you cannot 55 54 change the number of nodes once it is constructed. It is extremely memory 56 55 efficient: it uses constant amount of memory independently from the number of … … 58 57 \ref mapspage "EdgeMap"'s will depend on the number of nodes. 59 58 60 \li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class59 \li \ref NodeSet "NodeSet" implements a graph with no edges. This class 61 60 can be used as a base class of \ref lemon::EdgeSet "EdgeSet". 62 \li \ref lemon::EdgeSet "EdgeSet" can be used to create a new graph on61 \li \ref EdgeSet "EdgeSet" can be used to create a new graph on 63 62 the node set of another graph. The base graph can be an arbitrary graph and it 64 is possible to attach several \ref lemon::EdgeSet "EdgeSet"'s to a base graph.63 is possible to attach several \ref EdgeSet "EdgeSet"'s to a base graph. 65 64 66 65 \todo Don't we need SmartNodeSet and SmartEdgeSet? … … 121 120 step to the next node. Using operator++ on the iterator pointing to the last 122 121 node invalidates the iterator i.e. sets its value to 123 \ref lemon::INVALID "INVALID". This is what we exploit in the stop condition.122 \ref INVALID. This is what we exploit in the stop condition. 124 123 125 124 The previous code fragment prints out the following: … … 201 200 202 201 */ 202 203 } 204
Note: See TracChangeset
for help on using the changeset viewer.