doc/groups.dox
 branch 1.1 changeset 1081 f1398882a928 parent 844 c01a98ce01fd
     1.1 --- a/doc/groups.dox	Fri Aug 05 09:33:42 2011 +0200
1.2 +++ b/doc/groups.dox	Mon Aug 08 12:36:16 2011 +0200
1.3 @@ -2,7 +2,7 @@
1.4   *
1.5   * This file is a part of LEMON, a generic C++ optimization library.
1.6   *
1.7 - * Copyright (C) 2003-2009
1.8 + * Copyright (C) 2003-2011
1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11   *
1.12 @@ -275,7 +275,7 @@
1.13
1.14  This group contains the algorithms for finding shortest paths in digraphs.
1.15
1.16 - - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a
1.17 + - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a
1.18     source node when all arc lengths are non-negative.
1.19   - \ref Suurballe A successive shortest path algorithm for finding
1.20     arc-disjoint paths between two nodes having minimum total length.
1.21 @@ -306,7 +306,7 @@
1.22  minimum cut, which is the dual problem of maximum flow.
1.23
1.24
1.25 -\ref Circulation is a preflow push-relabel algorithm implemented directly
1.26 +\ref Circulation is a preflow push-relabel algorithm implemented directly
1.27  for finding feasible circulations, which is a somewhat different problem,
1.28  but it is strongly related to maximum flow.