52 /// amount of the nodes are written to \c supply (signed). The |
52 /// amount of the nodes are written to \c supply (signed). The |
53 /// lower bounds, capacities and costs of the edges are written to |
53 /// lower bounds, capacities and costs of the edges are written to |
54 /// \c lower, \c capacity and \c cost. |
54 /// \c lower, \c capacity and \c cost. |
55 /// |
55 /// |
56 /// \author Marton Makai and Peter Kovacs |
56 /// \author Marton Makai and Peter Kovacs |
57 template <typename Graph, typename SupplyMap, |
57 template <typename Graph, typename LowerMap, |
58 typename CapacityMap, typename CostMap> |
58 typename CapacityMap, typename CostMap, |
|
59 typename SupplyMap> |
59 void readDimacs( std::istream& is, |
60 void readDimacs( std::istream& is, |
60 Graph &g, |
61 Graph &g, |
61 SupplyMap& supply, |
62 LowerMap& lower, |
62 CapacityMap& lower, |
|
63 CapacityMap& capacity, |
63 CapacityMap& capacity, |
64 CostMap& cost ) |
64 CostMap& cost, |
|
65 SupplyMap& supply ) |
65 { |
66 { |
66 g.clear(); |
67 g.clear(); |
67 std::vector<typename Graph::Node> nodes; |
68 std::vector<typename Graph::Node> nodes; |
68 typename Graph::Edge e; |
69 typename Graph::Edge e; |
69 std::string problem, str; |
70 std::string problem, str; |