equal
deleted
inserted
replaced
162 typedef typename Digraph::template NodeMap<Value> CardinalityMap; |
162 typedef typename Digraph::template NodeMap<Value> CardinalityMap; |
163 |
163 |
164 /// \brief Instantiates a CardinalityMap. |
164 /// \brief Instantiates a CardinalityMap. |
165 /// |
165 /// |
166 /// This function instantiates a \ref CardinalityMap. |
166 /// This function instantiates a \ref CardinalityMap. |
167 /// \param digraph is the digraph, to which we would like to define the \ref |
167 /// \param digraph is the digraph, to which we would like to |
168 /// CardinalityMap |
168 /// define the \ref CardinalityMap |
169 static CardinalityMap *createCardinalityMap(const Digraph &digraph) { |
169 static CardinalityMap *createCardinalityMap(const Digraph &digraph) { |
170 return new CardinalityMap(digraph); |
170 return new CardinalityMap(digraph); |
171 } |
171 } |
172 |
172 |
173 |
173 |
178 /// \brief Maximum Cardinality Search algorithm class. |
178 /// \brief Maximum Cardinality Search algorithm class. |
179 /// |
179 /// |
180 /// This class provides an efficient implementation of Maximum Cardinality |
180 /// This class provides an efficient implementation of Maximum Cardinality |
181 /// Search algorithm. The maximum cardinality search first chooses any |
181 /// Search algorithm. The maximum cardinality search first chooses any |
182 /// node of the digraph. Then every time it chooses one unprocessed node |
182 /// node of the digraph. Then every time it chooses one unprocessed node |
183 /// with maximum cardinality, i.e the sum of capacities on out arcs to the nodes |
183 /// with maximum cardinality, i.e the sum of capacities on out arcs |
|
184 /// to the nodes |
184 /// which were previusly processed. |
185 /// which were previusly processed. |
185 /// If there is a cut in the digraph the algorithm should choose |
186 /// If there is a cut in the digraph the algorithm should choose |
186 /// again any unprocessed node of the digraph. |
187 /// again any unprocessed node of the digraph. |
187 |
188 |
188 /// The arc capacities are passed to the algorithm using a |
189 /// The arc capacities are passed to the algorithm using a |