[Lemon-commits] [lemon_svn] alpar: r763 - hugo/trunk/src/work/jacint

[Lemon SVN]

Author: alpar
Date: Sat May  8 18:04:28 2004
New Revision: 763

Modified:
   hugo/trunk/src/work/jacint/max_flow.h
   hugo/trunk/src/work/jacint/max_matching.h

Log:
doc

Modified: hugo/trunk/src/work/jacint/max_flow.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_flow.h	(original)
+++ hugo/trunk/src/work/jacint/max_flow.h	Sat May  8 18:04:28 2004
@@ -105,7 +105,11 @@
 
   public:
  
-    ///\todo Document this
+    ///\todo Document this.
+    ///\todo Maybe, it should be PRE_FLOW instead.
+    ///- \c ZERO_FLOW means something,
+    ///- \c GEN_FLOW means something else,
+    ///- \c PREFLOW is something different.
     enum flowEnum{
       ZERO_FLOW=0,
       GEN_FLOW=1,

Modified: hugo/trunk/src/work/jacint/max_matching.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_matching.h	(original)
+++ hugo/trunk/src/work/jacint/max_matching.h	Sat May  8 18:04:28 2004
@@ -54,9 +54,9 @@
 
     ///Indicates the Gallai-Edmonds decomposition of the graph, which
     ///shows an upper bound on the size of a maximum matching. The
-    ///nodes with pos_enum D induce a graph with factor-critical
-    ///components, the nodes in A form the canonical barrier, and the
-    ///nodes in C induce a graph having a perfect matching. 
+    ///nodes with pos_enum \c D induce a graph with factor-critical
+    ///components, the nodes in \c A form the canonical barrier, and the
+    ///nodes in \c C induce a graph having a perfect matching. 
     enum pos_enum {
       D=0,
       A=1,