Changeset 802:134852d7fb0a in lemon for lemon/preflow.h

Timestamp:

10/10/09 08:18:46 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Insert citations into the doc (#184)

• Add general citations to modules.
• Add specific citations for max flow and min cost flow algorithms.
• Add citations for the supported LP and MIP solvers.
• Extend the main page.
• Replace inproceedings entries with the journal versions.
• Add a new bibtex entry about network simplex.
• Remove unwanted entries.

File:

• lemon/preflow.h (modified) (1 diff)

lemon/preflow.h

@@ -103 +103 @@
   /// This class provides an implementation of Goldberg-Tarjan's \e preflow
   /// \e push-relabel algorithm producing a \ref max_flow
-  /// "flow of maximum value" in a digraph.
+  /// "flow of maximum value" in a digraph \ref clrs01algorithms,
+  /// \ref amo93networkflows, \ref goldberg88newapproach.
   /// The preflow algorithms are the fastest known maximum
   /// flow algorithms. The current implementation uses a mixture of the