Changeset 427:a677104e946a in lemon0.x for src/include/dimacs.h
 Timestamp:
 04/26/04 19:39:15 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@567
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/include/dimacs.h
r423 r427 7 7 #include <vector> 8 8 9 /// \file \brief Dimacs file format reader. 10 9 11 namespace hugo { 10 12 11 /// Dimacs flow file s.13 /// Dimacs flow file format reader function. 12 14 13 15 /// This function reads a flow instance from dimacs flow format. 14 /// At the beginning \c g is destroyed by \c g.clear().15 /// If the data coming from \c is is a max flow innstance, then16 /// \c s and \ t will be respectively the source and target nodes16 /// At the beginning \c g is cleared by \c g.clear(). 17 /// If the data coming from \c is is a max flow problem instance, then 18 /// \c s and \c t will be respectively the source and target nodes 17 19 /// and \c capacity will contain the edge capacities. 18 /// If the data is a shortest path problem then \c s will be the19 /// source node and \c apacity will contain the edge lengths.20 /// If the data is a shortest path problem instance then \c s will be the 21 /// source node and \c capacity will contain the edge lengths. 20 22 template<typename Graph, typename CapacityMap> 21 23 void readDimacsMaxFlow(std::istream& is, Graph &g, typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) {
Note: See TracChangeset
for help on using the changeset viewer.