equal
deleted
inserted
replaced
46 are shared by the edge pairs. |
46 are shared by the edge pairs. |
47 \li \ref lemon::FullGraph "FullGraph" |
47 \li \ref lemon::FullGraph "FullGraph" |
48 implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot |
48 implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot |
49 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 |
50 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 |
51 the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and |
51 the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and |
52 \ref maps "EdgeMap"'s will depend on the number of nodes. |
52 \ref maps-page "EdgeMap"'s will depend on the number of nodes. |
53 |
53 |
54 \li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class |
54 \li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class |
55 can be used as a base class of \ref lemon::EdgeSet "EdgeSet". |
55 can be used as a base class of \ref lemon::EdgeSet "EdgeSet". |
56 \li \ref lemon::EdgeSet "EdgeSet" can be used to create a new graph on |
56 \li \ref lemon::EdgeSet "EdgeSet" can be used to create a new graph on |
57 the node set of another graph. The base graph can be an arbitrary graph and it |
57 the node set of another graph. The base graph can be an arbitrary graph and it |
60 \todo Don't we need SmartNodeSet and SmartEdgeSet? |
60 \todo Don't we need SmartNodeSet and SmartEdgeSet? |
61 \todo Some cross-refs are wrong. |
61 \todo Some cross-refs are wrong. |
62 |
62 |
63 The graph structures itself can not store data attached |
63 The graph structures itself can not store data attached |
64 to the edges and nodes. However they all provide |
64 to the edges and nodes. However they all provide |
65 \ref maps "map classes" |
65 \ref maps-page "map classes" |
66 to dynamically attach data the to graph components. |
66 to dynamically attach data the to graph components. |
67 |
67 |
68 The following program demonstrates the basic features of LEMON's graph |
68 The following program demonstrates the basic features of LEMON's graph |
69 structures. |
69 structures. |
70 |
70 |
188 In the example above we create an EdgeMap which assigns an int value to all |
188 In the example above we create an EdgeMap which assigns an int value to all |
189 edges of the graph. We use the set member function of the map to write values |
189 edges of the graph. We use the set member function of the map to write values |
190 into the map and the operator[] to retrieve them. |
190 into the map and the operator[] to retrieve them. |
191 |
191 |
192 Here we used the maps provided by the ListGraph class, but you can also write |
192 Here we used the maps provided by the ListGraph class, but you can also write |
193 your own maps. You can read more about using maps \ref maps "here". |
193 your own maps. You can read more about using maps \ref maps-page "here". |
194 |
194 |
195 */ |
195 */ |