Changeset 1168:66400041ef2a in lemon0.x
 Timestamp:
 02/22/05 11:23:32 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1572
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/graphs.dox
r1043 r1168 6 6 provide a node list  edge list interface, i.e. they have 7 7 functionalities to list the nodes and the edges of the graph as well 8 as inincoming and outgoing edges of a given node.8 as incoming and outgoing edges of a given node. 9 9 10 10 … … 12 12 \ref lemon::concept::StaticGraph "StaticGraph" concept. 13 13 This concept does not 14 make sit possible to change the graph (i.e. it is not possible to add14 make it possible to change the graph (i.e. it is not possible to add 15 15 or delete edges or nodes). Most of the graph algorithms will run on 16 16 these graphs. … … 19 19 \ref lemon::concept::ExtendableGraph "ExtendableGraph" 20 20 concept allow node and 21 edge addition. You can also "clear" (i.e. erase all edges and nodes) 22 such a graph. 21 edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ). 23 22 24 23 In case of graphs meeting the full feature 25 24 \ref lemon::concept::ErasableGraph "ErasableGraph" 26 25 concept 27 you can also erase individual edges and node in arbitrary order.26 you can also erase individual edges and nodes in arbitrary order. 28 27 29 28 The implemented graph structures are the following. 30 29 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets 31 30 the \ref lemon::concept::ErasableGraph "ErasableGraph" concept 32 and it also ha ve some conveniencefeatures.31 and it also has some convenient extra features. 33 32 \li \ref lemon::SmartGraph "SmartGraph" is a more memory 34 33 efficient version of \ref lemon::ListGraph "ListGraph". The 35 price of itis that it only meets the34 price of this is that it only meets the 36 35 \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept, 37 36 so you cannot delete individual edges or nodes. … … 46 45 are shared by the edge pairs. 47 46 \li \ref lemon::FullGraph "FullGraph" 48 implements a fullgraph. It is a \ref lemon::concept::StaticGraph, so you cannot47 implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot 49 48 change the number of nodes once it is constructed. It is extremely memory 50 49 efficient: it uses constant amount of memory independently from the number of … … 61 60 \todo Some crossrefs are wrong. 62 61 63 The graph structures itselfcan not store data attached62 The graph structures themselves can not store data attached 64 63 to the edges and nodes. However they all provide 65 64 \ref mapspage "map classes" … … 101 100 \endcode 102 101 103 After some convenien cetypedefs we create a graph and add three nodes to it.104 Then we add edges to it to form a fullgraph.102 After some convenient typedefs we create a graph and add three nodes to it. 103 Then we add edges to it to form a complete graph. 105 104 106 105 \code … … 134 133 \endcode 135 134 136 We can also iterate through all edges of the graph very similarly. The target and 137 source member functions can be used to access the endpoints of an edge. 135 We can also iterate through all edges of the graph very similarly. The 136 \c target and 137 \c source member functions can be used to access the endpoints of an edge. 138 138 139 139 \code … … 186 186 called maps. 187 187 188 In the example above we create an EdgeMap which assigns an int value to all188 In the example above we create an EdgeMap which assigns an integer value to all 189 189 edges of the graph. We use the set member function of the map to write values 190 190 into the map and the operator[] to retrieve them.
Note: See TracChangeset
for help on using the changeset viewer.