Changeset 761:f1398882a928 in lemon-1.1 for doc/groups.dox

Timestamp:

08/08/11 12:36:16 (13 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

1.1

Phase:

public

Tags:

r1.1.4

Message:

Unify sources

File:

• doc/groups.dox (modified) (3 diffs)

doc/groups.dox

@@ -3 +3 @@
  * 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).
@@ -276 +276 @@
 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
@@ -307 +307 @@
 
 
-\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.