400 |
400 |
401 /// \brief Constructor. |
401 /// \brief Constructor. |
402 /// |
402 /// |
403 ///\param digraph the digraph the algorithm will run on. |
403 ///\param digraph the digraph the algorithm will run on. |
404 ///\param capacity the capacity map used by the algorithm. |
404 ///\param capacity the capacity map used by the algorithm. |
405 ///When no capacity map given, a constant 1 capacity map will |
|
406 ///be allocated. |
|
407 #ifdef DOXYGEN |
|
408 MaxCardinalitySearch(const Digraph& digraph, |
405 MaxCardinalitySearch(const Digraph& digraph, |
409 const CapacityMap& capacity=0 ) : |
406 const CapacityMap& capacity) : |
410 #else |
|
411 MaxCardinalitySearch(const Digraph& digraph, |
|
412 const CapacityMap& capacity=*static_cast<const CapacityMap*>(0) ) : |
|
413 #endif |
|
414 _graph(&digraph), |
407 _graph(&digraph), |
415 _capacity(&capacity), local_capacity(false), |
408 _capacity(&capacity), local_capacity(false), |
|
409 _cardinality(0), local_cardinality(false), |
|
410 _processed(0), local_processed(false), |
|
411 _heap_cross_ref(0), local_heap_cross_ref(false), |
|
412 _heap(0), local_heap(false) |
|
413 { } |
|
414 |
|
415 /// \brief Constructor. |
|
416 /// |
|
417 ///\param digraph the digraph the algorithm will run on. |
|
418 /// |
|
419 ///A constant 1 capacity map will be allocated. |
|
420 MaxCardinalitySearch(const Digraph& digraph) : |
|
421 _graph(&digraph), |
|
422 _capacity(0), local_capacity(false), |
416 _cardinality(0), local_cardinality(false), |
423 _cardinality(0), local_cardinality(false), |
417 _processed(0), local_processed(false), |
424 _processed(0), local_processed(false), |
418 _heap_cross_ref(0), local_heap_cross_ref(false), |
425 _heap_cross_ref(0), local_heap_cross_ref(false), |
419 _heap(0), local_heap(false) |
426 _heap(0), local_heap(false) |
420 { } |
427 { } |