Changeset 586:04fdffd38e89 in lemon-0.x for src/work/jacint/max_matching.h

Timestamp:

05/08/04 18:04:28 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@763

Message:

doc

File:

• src/work/jacint/max_matching.h (modified) (1 diff)

src/work/jacint/max_matching.h

@@ -55 +55 @@
     ///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,