equal
deleted
inserted
replaced
26 concept |
26 concept |
27 you can also erase individual edges and node in arbitrary order. |
27 you can also erase individual edges and node in arbitrary order. |
28 |
28 |
29 The implemented graph structures are the following. |
29 The implemented graph structures are the following. |
30 \li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets |
30 \li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets |
31 the hugo::skeleton::ErasableGraph "ErasableGraph" concept |
31 the \ref hugo::skeleton::ErasableGraph "ErasableGraph" concept |
32 and it also have some convenience features. |
32 and it also have some convenience features. |
33 \li \ref hugo::SmartGraph "SmartGraph" is a more memory |
33 \li \ref hugo::SmartGraph "SmartGraph" is a more memory |
34 efficient version of \ref hugo::ListGraph "ListGraph". The |
34 efficient version of \ref hugo::ListGraph "ListGraph". The |
35 price of it is that it only meets the |
35 price of it is that it only meets the |
36 \ref hugo::skeleton::ExtendableGraph "ExtendableGraph" concept, |
36 \ref hugo::skeleton::ExtendableGraph "ExtendableGraph" concept, |
43 They are linked together so it is possible to access the counterpart of an |
43 They are linked together so it is possible to access the counterpart of an |
44 edge. An even more important feature is that using these classes you can also |
44 edge. An even more important feature is that using these classes you can also |
45 attach data to the edges in such a way that the stored data |
45 attach data to the edges in such a way that the stored data |
46 are shared by the edge pairs. |
46 are shared by the edge pairs. |
47 \li \ref hugo::FullGraph "FullGraph" |
47 \li \ref hugo::FullGraph "FullGraph" |
48 implements a full graph. It is a \ref ConstGraph, so you cannot |
48 implements a full graph. It is a \ref hugo::skeleton::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 "NodeMap"'s and |
52 \ref maps "EdgeMap"'s will depend on the number of nodes. |
52 \ref maps "EdgeMap"'s will depend on the number of nodes. |
53 |
53 |