diff -r f22bc76370b2 -r f1398882a928 doc/groups.dox
--- a/doc/groups.dox	Fri Aug 05 09:33:42 2011 +0200
+++ b/doc/groups.dox	Mon Aug 08 12:36:16 2011 +0200
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2011
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *
@@ -275,7 +275,7 @@
 
 This group contains the algorithms for finding shortest paths in digraphs.
 
- - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a 
+ - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a
    source node when all arc lengths are non-negative.
  - \ref Suurballe A successive shortest path algorithm for finding
    arc-disjoint paths between two nodes having minimum total length.
@@ -306,7 +306,7 @@
 minimum cut, which is the dual problem of maximum flow.
 
 
-\ref Circulation is a preflow push-relabel algorithm implemented directly 
+\ref Circulation is a preflow push-relabel algorithm implemented directly
 for finding feasible circulations, which is a somewhat different problem,
 but it is strongly related to maximum flow.
 For more information, see \ref Circulation.