org.gersteinlab.tyna.core.graph
Interface NodeIterator

All Known Implementing Classes:
AbstractGraph.AbstractGraphNodeIterator, CategoryInfo.CategoryInfoNodeIterator

public interface NodeIterator

        This interface declares that each implemented class is an iterator of
        a set of nodes of a graph.
        

Version:
1.0 (September 20, 2005) Change History: 1.0 - Initial version
Author:
Kevin Yuk-Lap Yip

Method Summary
 boolean hasNext()
          Check whether there are still nodes to be iterated.
 Node next()
          Get the next node of the graph.
 

Method Detail

hasNext

boolean hasNext()
                throws java.util.ConcurrentModificationException
Check whether there are still nodes to be iterated.

Returns:
Whether there are still nodes to be iterated
Throws:
java.util.ConcurrentModificationException - If the graph has been modified after the creation of the iterator

next

Node next()
          throws java.util.ConcurrentModificationException,
                 java.util.NoSuchElementException
Get the next node of the graph.

Returns:
The next node
Throws:
java.util.ConcurrentModificationException - If the graph has been modified after the creation of the iterator
java.util.NoSuchElementException - If there are no more nodes to be iterated