Changeset 465:d72e56f1730d in lemon-0.x for src/include/dimacs.h

Timestamp:

04/29/04 11:08:14 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@616

Message:

mods implied by preflow mods

File:

• src/include/dimacs.h (modified) (1 diff)

src/include/dimacs.h

@@ -21 +21 @@
   /// If the data is a shortest path problem instance then \c s will be the 
   /// source node and \c capacity will contain the edge lengths.
+  ///
+  ///\author Marton Makai
   template<typename Graph, typename CapacityMap>
   void readDimacsMaxFlow(std::istream& is, Graph &g, typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {