net.walend.digraph
Interface EdgeIterator

All Superinterfaces:
EdgeNodeIterator
All Known Subinterfaces:
IndexedEdgeIterator
All Known Implementing Classes:
AbstractDelegateDigraphOfCEPaths.ADDOCEPIndexedEdgeIterator, AbstractDelegateDigraphOfCEPaths.DigraphCEPath.PathEdgeIterator, AbstractDelegateDigraphOfGEPaths.ADDOCEPIndexedEdgeIterator, AbstractHashCEDigraph.HashEdgeIterator, AbstractHashUEDigraph.HashEdgeIterator, AbstractListCEPath.ListEdgeIterator, AbstractListUEPath.ListEdgeIterator, AbstractLMCEDigraph.LMEdgeIterator, AbstractMatrixCEDigraph.MatrixEdgeIterator, AbstractMatrixUEDigraph.MatrixEdgeIterator, CEBellmanFordTest.BFCEDigraph.WrappingEdgeIterator, ImmutableEdgeIterator

public interface EdgeIterator
extends EdgeNodeIterator

EdgeIterator extends EdgeNodeIterator by adding a method to get the current edge.

Since:
20010813
Author:
David Walend dfw1@cornell.edu

Method Summary
 java.lang.Object edge()
          Returns the current edge.
 
Methods inherited from interface net.walend.digraph.EdgeNodeIterator
fromNode, hasNext, next, remove, toNode
 

Method Detail

edge

public java.lang.Object edge()
Returns the current edge.

Throws:
java.lang.IllegalStateException - if the next method has not yet been called, or the remove method has already been called after the last call to the next method.


Copyright (c) 2001, 2002, David Walend