933934935936937938939940941942943
while (arcIter.hasNext()) { int arc = arcIter.next(); for (int i = 0; i < z.length; i++) gcost[i] += graph.GArcs.originalCost[arc][i]; } arcIter.dispose(); } it.dispose(); } for (int i = 0; i < gcost.length; i++) {
184185186187188189190191192193194
this.graph.setInStack(id); this.toRemove.push(id); } } it.dispose(); try { do { while (toRemove.size() > 0) { int id = toRemove.pop();
249250251252253254255256257258259
if ((lpfs + lpft + acost < vars[zIdx].getLB() || spfs + spft + acost > vars[zIdx].getUB()) && !this.graph.isInStack(id)) { this.graph.setInStack(id); this.toRemove.push(id); } } it.dispose(); } do { while (toRemove.size() > 0) {
305306307308309310311312313314
p.graph.setInStack(arcId); p.toRemove.push(arcId); // mod = true; } } it.dispose(); } } } }
200201202203204205206207208209210
it = in.getIterator(); while (it.hasNext()) { int id = it.next(); stack.push(id); } it.dispose(); } } in = GNodes.inArcs[dest]; in.remove(arcId);
215216217218219220221222223224225
it = out.getIterator(); while (it.hasNext()) { int id = it.next(); stack.push(id); } it.dispose(); } } } }
229230231232233234235236237238239
DisposableIntIterator it = supports.getIterator(); while (it.hasNext()) { int arcId = it.next(); stack.push(arcId); } it.dispose(); removeArc(p); } } @Override
253254255256257258259260261262263
DisposableIntIterator it = supports[i].getIterator(); while (it.hasNext()) { int arcId = it.next(); st.append(arcId).append(","); } it.dispose(); st.append("\n"); } } return st.toString(); }
390391392393394395396397398399400
graph.GNodes.prevLP[dest] = e; update = true; } } } in.dispose(); } destIter.dispose(); if (!update) propagator.contradiction(null, "no update"); }
435436437438439440441442443444445
} } } out.dispose(); } origIter.dispose(); if (!update) propagator.contradiction(null, "no update"); }