110 this with shortest path algorithms or minimum mean cycle algorithms, |
110 this with shortest path algorithms or minimum mean cycle algorithms, |
111 a range of weighted and cardinality optimization algorithms can be |
111 a range of weighted and cardinality optimization algorithms can be |
112 obtained. For other examples, the interested user is referred to the |
112 obtained. For other examples, the interested user is referred to the |
113 detailed documentation of particular adaptors. |
113 detailed documentation of particular adaptors. |
114 |
114 |
|
115 Since the adaptor classes conform to the \ref graph_concepts "graph concepts", |
|
116 an adaptor can even be applied to another one. |
|
117 The following image illustrates a situation when a \ref SubDigraph adaptor |
|
118 is applied on a digraph and \ref Undirector is applied on the subgraph. |
|
119 |
|
120 \image html adaptors2.png |
|
121 \image latex adaptors2.eps "Using graph adaptors" width=\textwidth |
|
122 |
115 The behavior of graph adaptors can be very different. Some of them keep |
123 The behavior of graph adaptors can be very different. Some of them keep |
116 capabilities of the original graph while in other cases this would be |
124 capabilities of the original graph while in other cases this would be |
117 meaningless. This means that the concepts that they meet depend |
125 meaningless. This means that the concepts that they meet depend |
118 on the graph adaptor, and the wrapped graph. |
126 on the graph adaptor, and the wrapped graph. |
119 For example, if an arc of a reversed digraph is deleted, this is carried |
127 For example, if an arc of a reversed digraph is deleted, this is carried |