Changes in / [426:b2564598b46d:424:346991bf7ddd] in lemon-1.1

Location:

lemon

Files:

• connectivity.h (modified) (2 diffs)
• max_matching.h (modified) (1 diff)
• suurballe.h (modified) (1 diff)

lemon/connectivity.h

@@ -296 +296 @@
   /// direction.
   ///
-  /// \param digraph The graph.
+  /// \param graph The graph.
   /// \return The number of components
   /// \note By definition, the empty graph has zero
@@ -1226 +1226 @@
   /// that the given graph is DAG.
   ///
-  /// \param digraph The graph. It must be directed and acyclic.
+  /// \param graph The graph. It must be directed and acyclic.
   /// \retval order A readable - writable node map. The values will be set
   /// from 0 to the number of the nodes in the graph minus one. Each values

lemon/max_matching.h

@@ -417 +417 @@
     /// \ref init(), \ref greedyInit() or \ref matchingInit()
     /// functions first, then you can start the algorithm with the \ref
-    /// startSparse() or startDense() functions.
+    /// startParse() or startDense() functions.
 
     ///@{

lemon/suurballe.h

@@ -52 +52 @@
   ///
   /// \note For finding node-disjoint paths this algorithm can be used
-  /// with \ref SplitNodes.
+  /// with \ref SplitDigraphAdaptor.
 #ifdef DOXYGEN
   template <typename Digraph, typename LengthMap>