1.1 --- a/src/work/jacint/max_flow.h	Sat May 08 16:00:57 2004 +0000
     1.2 +++ b/src/work/jacint/max_flow.h	Sat May 08 16:04:28 2004 +0000
     1.3 @@ -105,7 +105,11 @@
     1.4  
     1.5    public:
     1.6   
     1.7 -    ///\todo Document this
     1.8 +    ///\todo Document this.
     1.9 +    ///\todo Maybe, it should be PRE_FLOW instead.
    1.10 +    ///- \c ZERO_FLOW means something,
    1.11 +    ///- \c GEN_FLOW means something else,
    1.12 +    ///- \c PREFLOW is something different.
    1.13      enum flowEnum{
    1.14        ZERO_FLOW=0,
    1.15        GEN_FLOW=1,

     2.1 --- a/src/work/jacint/max_matching.h	Sat May 08 16:00:57 2004 +0000
     2.2 +++ b/src/work/jacint/max_matching.h	Sat May 08 16:04:28 2004 +0000
     2.3 @@ -54,9 +54,9 @@
     2.4  
     2.5      ///Indicates the Gallai-Edmonds decomposition of the graph, which
     2.6      ///shows an upper bound on the size of a maximum matching. The
     2.7 -    ///nodes with pos_enum D induce a graph with factor-critical
     2.8 -    ///components, the nodes in A form the canonical barrier, and the
     2.9 -    ///nodes in C induce a graph having a perfect matching. 
    2.10 +    ///nodes with pos_enum \c D induce a graph with factor-critical
    2.11 +    ///components, the nodes in \c A form the canonical barrier, and the
    2.12 +    ///nodes in \c C induce a graph having a perfect matching. 
    2.13      enum pos_enum {
    2.14        D=0,
    2.15        A=1,