# HG changeset patch
# User alpar
# Date 1084032268 0
# Node ID 04fdffd38e89899780e4d6ee251eecf9eb759d2b
# Parent  87c34740a0ec6fb3de9a443eed4557546fdc5db8
doc

diff -r 87c34740a0ec -r 04fdffd38e89 src/work/jacint/max_flow.h
--- a/src/work/jacint/max_flow.h	Sat May 08 16:00:57 2004 +0000
+++ b/src/work/jacint/max_flow.h	Sat May 08 16:04:28 2004 +0000
@@ -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,
diff -r 87c34740a0ec -r 04fdffd38e89 src/work/jacint/max_matching.h
--- a/src/work/jacint/max_matching.h	Sat May 08 16:00:57 2004 +0000
+++ b/src/work/jacint/max_matching.h	Sat May 08 16:04:28 2004 +0000
@@ -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,