equal
deleted
inserted
replaced
18 /// If the data coming from \c is is a max flow problem instance, then |
18 /// If the data coming from \c is is a max flow problem instance, then |
19 /// \c s and \c t will be respectively the source and target nodes |
19 /// \c s and \c t will be respectively the source and target nodes |
20 /// and \c capacity will contain the edge capacities. |
20 /// and \c capacity will contain the edge capacities. |
21 /// If the data is a shortest path problem instance then \c s will be the |
21 /// If the data is a shortest path problem instance then \c s will be the |
22 /// source node and \c capacity will contain the edge lengths. |
22 /// source node and \c capacity will contain the edge lengths. |
|
23 /// |
|
24 ///\author Marton Makai |
23 template<typename Graph, typename CapacityMap> |
25 template<typename Graph, typename CapacityMap> |
24 void readDimacsMaxFlow(std::istream& is, Graph &g, typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) { |
26 void readDimacsMaxFlow(std::istream& is, Graph &g, typename Graph::Node &s, typename Graph::Node &t, CapacityMap& capacity) { |
25 g.clear(); |
27 g.clear(); |
26 int cap; |
28 int cap; |
27 char d; |
29 char d; |