83 /// sg problem |
83 /// sg problem |
84 template<typename Graph, typename CapacityMap> |
84 template<typename Graph, typename CapacityMap> |
85 void readDimacs(std::istream& is, Graph &g, CapacityMap& capacity) { |
85 void readDimacs(std::istream& is, Graph &g, CapacityMap& capacity) { |
86 typename Graph::Node u; |
86 typename Graph::Node u; |
87 NullMap<typename Graph::Edge, int> n; |
87 NullMap<typename Graph::Edge, int> n; |
88 readDimacs(is, g, cap, u, u, n); |
88 readDimacs(is, g, capacity, u, u, n); |
89 } |
89 } |
90 |
90 |
91 /// shortest path problem |
91 /// shortest path problem |
92 template<typename Graph, typename CapacityMap> |
92 template<typename Graph, typename CapacityMap> |
93 void readDimacs(std::istream& is, Graph &g, CapacityMap& capacity, |
93 void readDimacs(std::istream& is, Graph &g, CapacityMap& capacity, |