488489490491492493494495496497498
if (bipartiteGraph.degree(end) == 0) { bipartiteGraph.removeVertex(end); } } } else { edge.addWeight(-weight); } } } // For each conflict, update values
442443444445446447448449450451452
affinityGraph.removeVertex(end); identMap.remove(end.getIdentity()); } } } else { edge.addWeight(-weight); } } } stats.processingTimeInc(System.currentTimeMillis() - startTime);
522523524525526527528529530531532
affinityGraph.removeVertex(end); identMap.remove(end.getIdentity()); } } } else { edge.addWeight(-weight); } } } // For each conflict, update values
269270271272273274275276277278279
WeightedEdge edge = foldedGraph.findEdge(label1, label2); if (edge == null) { foldedGraph.addEdge(new WeightedEdge(minWeight), label1, label2); } else { edge.addWeight(minWeight); } } } }