equal
deleted
inserted
replaced
85 getline(is, str); |
85 getline(is, str); |
86 if (problem != "min") return; |
86 if (problem != "min") return; |
87 nodes.resize(n + 1); |
87 nodes.resize(n + 1); |
88 for (int k = 1; k <= n; ++k) { |
88 for (int k = 1; k <= n; ++k) { |
89 nodes[k] = g.addNode(); |
89 nodes[k] = g.addNode(); |
90 supply[nodes[k]] = 0; |
90 supply.set(nodes[k], 0); |
91 } |
91 } |
92 break; |
92 break; |
93 case 'n': // node definition line |
93 case 'n': // node definition line |
94 is >> i >> sup; |
94 is >> i >> sup; |
95 getline(is, str); |
95 getline(is, str); |