Changeset 425:cace3206223b in lemon1.2 for lemon
 Timestamp:
 12/08/08 11:06:39 (13 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 lemon
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

lemon/connectivity.h
r419 r425 296 296 /// direction. 297 297 /// 298 /// \param graph The graph.298 /// \param digraph The graph. 299 299 /// \return The number of components 300 300 /// \note By definition, the empty graph has zero … … 1226 1226 /// that the given graph is DAG. 1227 1227 /// 1228 /// \param graph The graph. It must be directed and acyclic.1228 /// \param digraph The graph. It must be directed and acyclic. 1229 1229 /// \retval order A readable  writable node map. The values will be set 1230 1230 /// from 0 to the number of the nodes in the graph minus one. Each values 
lemon/max_matching.h
r330 r425 417 417 /// \ref init(), \ref greedyInit() or \ref matchingInit() 418 418 /// functions first, then you can start the algorithm with the \ref 419 /// start Parse() or startDense() functions.419 /// startSparse() or startDense() functions. 420 420 421 421 ///@{ 
lemon/suurballe.h
r346 r425 52 52 /// 53 53 /// \note For finding nodedisjoint paths this algorithm can be used 54 /// with \ref Split DigraphAdaptor.54 /// with \ref SplitNodes. 55 55 #ifdef DOXYGEN 56 56 template <typename Digraph, typename LengthMap>
Note: See TracChangeset
for help on using the changeset viewer.