equal
deleted
inserted
replaced
42 They are linked together so it is possible to access the counterpart of an |
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 |
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 |
44 attach data to the edges in such a way that the stored data |
45 are shared by the edge pairs. |
45 are shared by the edge pairs. |
46 \li \ref lemon::FullGraph "FullGraph" |
46 \li \ref lemon::FullGraph "FullGraph" |
47 implements a complete graph. It is a \ref lemon::concept::StaticGraph, so you cannot |
47 implements a complete graph. It is a |
|
48 \ref lemon::concept::StaticGraph "StaticGraph", so you cannot |
48 change the number of nodes once it is constructed. It is extremely memory |
49 change the number of nodes once it is constructed. It is extremely memory |
49 efficient: it uses constant amount of memory independently from the number of |
50 efficient: it uses constant amount of memory independently from the number of |
50 the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and |
51 the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and |
51 \ref maps-page "EdgeMap"'s will depend on the number of nodes. |
52 \ref maps-page "EdgeMap"'s will depend on the number of nodes. |
52 |
53 |