1020102110221023102410251026102710281029103010311032
impost1 = impost2; impost2 = t; } int inCommon = 0; IntIterator it = n1.iterator(); while (it.hasNext()) { int v = it.nextInt(); if (n2.contains(v)) inCommon++; } if (n2.contains(impost1))
161162163164165166167168169170171172173
copy.edges.put(v, iter.value()); } } else { IntIterator iter = vertices.iterator(); while (iter.hasNext()) { int v = iter.nextInt(); if (edges.containsKey(v)) copy.edges.put(v, edges.get(v)); } } return copy;