# Methods

`-fetchNextNode`
  fetch the next node, if existent
`-hasNext`
`-initWithIdEnumerator`
`-initWithIdEnumerator:forGraph:`
`-next`

### fetchNextNode

fetch the next node, if existent

>     - (FTNodeImpl *) fetchNextNode;

method result
  the next node, if existent

### hasNext

>     - (BOOL) hasNext;

method result
  returns YES if there is at least a datum at the current iteration step

### initWithIdEnumerator

See Also:

> initWithIdEnumerator:forGraph:

>     - initWithIdEnumerator: (NSEnumerator *) idEnumerator forGraph: (FTGraphImpl *) aGraph;

##### Parameter Descriptions

> `idEnumerator`
>   enumeration of node identifiers
> `aGraph`
>   underlying graph instance

method result
  self

### initWithIdEnumerator:forGraph:

See Also:

> initWithIdEnumerator

>     - initWithIdEnumerator: (NSEnumerator *) idEnumerator forGraph: (FTGraphImpl *) aGraph;

##### Parameter Descriptions

> `idEnumerator`
>   enumeration of node identifiers
> `aGraph`
>   underlying graph instance

### next

>     - next;

method result
  returns the next object of the set to iterate or nil, if not existent

(Last Updated August 27, 2006)