32 \li \ref lemon::SmartGraph "SmartGraph" is a more memory |
32 \li \ref lemon::SmartGraph "SmartGraph" is a more memory |
33 efficient version of \ref lemon::ListGraph "ListGraph". The |
33 efficient version of \ref lemon::ListGraph "ListGraph". The |
34 price of this is that it only meets the |
34 price of this is that it only meets the |
35 \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept, |
35 \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept, |
36 so you cannot delete individual edges or nodes. |
36 so you cannot delete individual edges or nodes. |
37 \li \ref lemon::SymListGraph "SymListGraph" and |
|
38 \ref lemon::SymSmartGraph "SymSmartGraph" classes are very similar to |
|
39 \ref lemon::ListGraph "ListGraph" and \ref lemon::SmartGraph "SmartGraph". |
|
40 The difference is that whenever you add a |
|
41 new edge to the graph, it actually adds a pair of oppositely directed edges. |
|
42 They are linked together so it is possible to access the counterpart of an |
|
43 edge. An even more important feature is that using these classes you can also |
|
44 attach data to the edges in such a way that the stored data |
|
45 are shared by the edge pairs. |
|
46 \li \ref lemon::FullGraph "FullGraph" |
37 \li \ref lemon::FullGraph "FullGraph" |
47 implements a complete graph. It is a |
38 implements a complete graph. It is a |
48 \ref lemon::concept::StaticGraph "StaticGraph", so you cannot |
39 \ref lemon::concept::StaticGraph "StaticGraph", so you cannot |
49 change the number of nodes once it is constructed. It is extremely memory |
40 change the number of nodes once it is constructed. It is extremely memory |
50 efficient: it uses constant amount of memory independently from the number of |
41 efficient: it uses constant amount of memory independently from the number of |