Changeset 2037:32e4bebee616 in lemon0.x for lemon/min_cut.h
 Timestamp:
 04/04/06 19:43:23 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2676
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/min_cut.h
r1993 r2037 121 121 /// 122 122 /// This function instantiates a \ref ProcessedMap. 123 /// \param g is the graph, to which123 /// \param graph is the graph, to which 124 124 /// we would like to define the \ref ProcessedMap 125 125 #ifdef DOXYGEN … … 363 363 /// \brief Constructor. 364 364 /// 365 ///\param _graph the graph the algorithm will run on.366 ///\param _capacity the capacity map used by the algorithm.365 ///\param graph the graph the algorithm will run on. 366 ///\param capacity the capacity map used by the algorithm. 367 367 MaxCardinalitySearch(const Graph& graph, const CapacityMap& capacity) : 368 368 _graph(&graph), _capacity(&capacity),
Note: See TracChangeset
for help on using the changeset viewer.