@Override
	public Iterator<Node> allNodesIterator() {
		
		return new Iterator<Node>() {
			
			long id = 0;

			@Override
			public boolean hasNext() {
				return id < getNumberOfNodes();
			}

			@Override
			public Node next() {
				return new Node(getExternalIdByInternalId(id++));
			}
			
			@Override
			public void remove() {
				Iterator.super.remove();
			}
		};
		
	}
@ Override public Iterator < Node > allNodesIterator ( ) { return new Iterator < Node > ( ) { long id = 0 ; @ Override public boolean hasNext ( ) { return id < getNumberOfNodes ( ) ; } @ Override public Node next ( ) { return new Node ( getExternalIdByInternalId ( id ++ ) ) ; } @ Override public void remove ( ) { Iterator . super . remove ( ) ; } } ; }
@return an iterator to graph's nodes.