... | ... |
@@ -295,17 +295,22 @@ |
295 | 295 |
if (!_next_rep) { |
296 | 296 |
_next_rep = new NodeList(_graph); |
297 | 297 |
} |
298 | 298 |
if (!_cut_map) { |
299 | 299 |
_cut_map = new MinCutMap(_graph); |
300 | 300 |
} |
301 | 301 |
} |
302 | 302 |
|
303 |
|
|
303 |
protected: |
|
304 |
//This is here to avoid a gcc-3.3 compilation error. |
|
305 |
//It should never be called. |
|
306 |
NagamochiIbaraki() {} |
|
307 |
|
|
308 |
public: |
|
304 | 309 |
|
305 | 310 |
typedef NagamochiIbaraki Create; |
306 | 311 |
|
307 | 312 |
|
308 | 313 |
/// \brief Constructor. |
309 | 314 |
/// |
310 | 315 |
/// \param graph The graph the algorithm runs on. |
311 | 316 |
/// \param capacity The capacity map used by the algorithm. |
0 comments (0 inline)