equal
deleted
inserted
replaced
118 typedef NullMap<typename Graph::Node, bool> ProcessedMap; |
118 typedef NullMap<typename Graph::Node, bool> ProcessedMap; |
119 |
119 |
120 /// \brief Instantiates a ProcessedMap. |
120 /// \brief Instantiates a ProcessedMap. |
121 /// |
121 /// |
122 /// This function instantiates a \ref ProcessedMap. |
122 /// This function instantiates a \ref ProcessedMap. |
123 /// \param g is the graph, to which |
123 /// \param graph is the graph, to which |
124 /// we would like to define the \ref ProcessedMap |
124 /// we would like to define the \ref ProcessedMap |
125 #ifdef DOXYGEN |
125 #ifdef DOXYGEN |
126 static ProcessedMap *createProcessedMap(const Graph &graph) |
126 static ProcessedMap *createProcessedMap(const Graph &graph) |
127 #else |
127 #else |
128 static ProcessedMap *createProcessedMap(const Graph &) |
128 static ProcessedMap *createProcessedMap(const Graph &) |
360 |
360 |
361 public: |
361 public: |
362 |
362 |
363 /// \brief Constructor. |
363 /// \brief Constructor. |
364 /// |
364 /// |
365 ///\param _graph the graph the algorithm will run on. |
365 ///\param graph the graph the algorithm will run on. |
366 ///\param _capacity the capacity map used by the algorithm. |
366 ///\param capacity the capacity map used by the algorithm. |
367 MaxCardinalitySearch(const Graph& graph, const CapacityMap& capacity) : |
367 MaxCardinalitySearch(const Graph& graph, const CapacityMap& capacity) : |
368 _graph(&graph), _capacity(&capacity), |
368 _graph(&graph), _capacity(&capacity), |
369 _cardinality(0), local_cardinality(false), |
369 _cardinality(0), local_cardinality(false), |
370 _processed(0), local_processed(false), |
370 _processed(0), local_processed(false), |
371 _heap_cross_ref(0), local_heap_cross_ref(false), |
371 _heap_cross_ref(0), local_heap_cross_ref(false), |