public Iterator<Node> getNeighborNodeIterator() { ArrayList<Node> l; Iterator<Node> it; elementLock.lock(); sg.elementLock.lock(); l = new ArrayList<Node>(wrappedElement.getDegree()); it = wrappedElement.getNeighborNodeIterator(); while (it.hasNext()) l.add(sg.getNode(it.next().getIndex())); sg.elementLock.unlock(); elementLock.unlock(); return l.iterator(); }
public Iterator<Node> getNeighborNodeIterator() { ArrayList<Node> l; Iterator<Node> it; elementLock.lock(); sg.elementLock.lock(); l = new ArrayList<Node>(wrappedElement.getDegree()); it = wrappedElement.getNeighborNodeIterator(); while (it.hasNext()) l.add(sg.getNode(it.next().getIndex())); sg.elementLock.unlock(); elementLock.unlock(); return l.iterator(); }
Iterator<Node> it = n.getNeighborNodeIterator(); Integer index;
Iterator<Node> it = n.getNeighborNodeIterator(); Integer index;
if (ordering != null) ordering.add((T) entry.node); Iterator<Node> neighborIt = entry.node.getNeighborNodeIterator(); while (neighborIt.hasNext()) { Node x = neighborIt.next();
if (ordering != null) ordering.add((T) entry.node); Iterator<Node> neighborIt = entry.node.getNeighborNodeIterator(); while (neighborIt.hasNext()) { Node x = neighborIt.next();