equal
deleted
inserted
replaced
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 an other algorithm, or a node-set |
32 is to be shrunk for an other algorithm. |
32 is to be shrunk for an other 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 gwrappers "graph wrappers". Wrappers 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 |
38 the best, most graph algorithms and auxiliary data structures can be used |
38 the best, most graph algorithms and auxiliary data structures can be used |
39 with any graph structures. |
39 with any graph structures. |