equal
deleted
inserted
replaced
1501 stack.push_back(u); |
1501 stack.push_back(u); |
1502 } |
1502 } |
1503 } |
1503 } |
1504 } |
1504 } |
1505 } else { |
1505 } else { |
1506 // Find the min. cost incomming arc for each demand node |
1506 // Find the min. cost incoming arc for each demand node |
1507 for (int i = 0; i != int(demand_nodes.size()); ++i) { |
1507 for (int i = 0; i != int(demand_nodes.size()); ++i) { |
1508 Node v = demand_nodes[i]; |
1508 Node v = demand_nodes[i]; |
1509 Cost c, min_cost = std::numeric_limits<Cost>::max(); |
1509 Cost c, min_cost = std::numeric_limits<Cost>::max(); |
1510 Arc min_arc = INVALID; |
1510 Arc min_arc = INVALID; |
1511 for (InArcIt a(_graph, v); a != INVALID; ++a) { |
1511 for (InArcIt a(_graph, v); a != INVALID; ++a) { |