org.gersteinlab.tyna.core.graph
Interface EdgeIterator

All Known Implementing Classes:
AbstractGraph.AbstractGraphEdgeIterator, AbstractMultiGraph.AbstractMultiGraphEdgeIterator, AbstractSimpleGraph.AbstractSimpleGraphEdgeIterator, DirectedMultiGraph.DirectedMultiGraphEdgeIterator, DirectedSimpleGraph.DirectedSimpleGraphEdgeIterator, UndirectedMultiGraph.UndirectedMultiGraphEdgeIterator, UndirectedSimpleGraph.UndirectedSimpleGraphEdgeIterator

public interface EdgeIterator

        This interface declares that each implemented class is an iterator of
        a set of edges 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 edges to be iterated.
 Edge next()
          Get the next edge of the graph.
 

Method Detail

hasNext

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

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

next

Edge next()
          throws java.util.ConcurrentModificationException,
                 java.util.NoSuchElementException
Get the next edge of the graph.

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