equal
deleted
inserted
replaced
52 |
52 |
53 ///Indicates the Gallai-Edmonds decomposition of the graph. |
53 ///Indicates the Gallai-Edmonds decomposition of the graph. |
54 |
54 |
55 ///Indicates the Gallai-Edmonds decomposition of the graph, which |
55 ///Indicates the Gallai-Edmonds decomposition of the graph, which |
56 ///shows an upper bound on the size of a maximum matching. The |
56 ///shows an upper bound on the size of a maximum matching. The |
57 ///nodes with pos_enum D induce a graph with factor-critical |
57 ///nodes with pos_enum \c D induce a graph with factor-critical |
58 ///components, the nodes in A form the canonical barrier, and the |
58 ///components, the nodes in \c A form the canonical barrier, and the |
59 ///nodes in C induce a graph having a perfect matching. |
59 ///nodes in \c C induce a graph having a perfect matching. |
60 enum pos_enum { |
60 enum pos_enum { |
61 D=0, |
61 D=0, |
62 A=1, |
62 A=1, |
63 C=2 |
63 C=2 |
64 }; |
64 }; |