# Changeset 2352:5e273e0bd5e2 in lemon-0.x

Ignore:
Timestamp:
01/25/07 15:36:21 (11 years ago)
Branch:
default
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3148
Message:

Doc improvements

Location:
lemon
Files:
2 edited

Unmodified
Removed
• ## lemon/bipartite_matching.h

 r2269 /// /// It runs an augmenting phase of the Hopcroft-Karp /// algorithm. The phase finds maximum count of edge disjoint /// algorithm. This phase finds maximum count of edge disjoint /// augmenting paths and augments on these paths. The algorithm /// consists at most of \f$O(\sqrt{n}) \f$ phase and one phase is /// /// It runs an augmenting phase of the Ford-Fulkerson /// algorithm. The phase finds only one augmenting path and /// algorithm. This phase finds only one augmenting path and /// augments only on this paths. The algorithm consists at most /// of \f$O(n) \f$ simple phase and one phase is at most /// /// It runs an augmenting phase of the weighted matching /// algorithm. The phase finds the best augmenting path and /// algorithm. This phase finds the best augmenting path and /// augments only on this paths. ///
• ## lemon/elevator.h

 r2350 /// ///\ingroup auxdat ///Using this class you can assign "labels" (nonnegativ integer numbers) ///Using this class you can assign "labels" (nonnegative integer numbers) ///to the edges or nodes of a graph, manipulate and query them through ///operations typically arising in "push-relabel" type algorithms.
Note: See TracChangeset for help on using the changeset viewer.