380381382383384385386387388389390
list2.add(graph.getNeighbor(v, d)); } list2.sort(); boolean contains = true; for (int x = 0; contains && x < list1.size(); x++) { if (list2.binarySearch(list1.get(x)) < 0) { contains = false; } } if (contains) { list.add(u);