23 fail to provide some graph features like edge or node deletion. |
23 fail to provide some graph features like edge or node deletion. |
24 |
24 |
25 Alteration of standard containers need a very limited number of |
25 Alteration of standard containers need a very limited number of |
26 operations, these together satisfy the everyday requirements. |
26 operations, these together satisfy the everyday requirements. |
27 In the case of graph strutures, different operations are needed which do |
27 In the case of graph strutures, different operations are needed which do |
28 not alter the physical graph, but gives an other view. If some nodes or |
28 not alter the physical graph, but gives another view. If some nodes or |
29 edges have to be hidden or the reverse oriented graph have to be used, then |
29 edges have to be hidden or the reverse oriented graph have to be used, then |
30 this is the case. It also may happen that in a flow implemenation |
30 this is the case. It also may happen that in a flow implemenation |
31 the residual graph can be accessed by an other algorithm, or a node-set |
31 the residual graph can be accessed by another algorithm, or a node-set |
32 is to be shrunk for an other algorithm. |
32 is to be shrunk for another algorithm. |
33 LEMON also provides a variety of graphs for these requirements called |
33 LEMON also provides a variety of graphs for these requirements called |
34 \ref graph_adaptors "graph adaptors". Adaptors cannot be used alone but only |
34 \ref graph_adaptors "graph adaptors". Adaptors cannot be used alone but only |
35 in conjunction with other graph representation. |
35 in conjunction with other graph representation. |
36 |
36 |
37 You are free to use the graph structure that fit your requirements |
37 You are free to use the graph structure that fit your requirements |