net.walend.digraph
Interface IndexedEdgeNodeIterator

All Superinterfaces:

EdgeNodeIterator

All Known Subinterfaces:

IndexedEdgeIterator

All Known Implementing Classes:

AbstractDelegateDigraphOfCEPaths.ADDOCEPIndexedEdgeIterator, AbstractDelegateDigraphOfGEPaths.ADDOCEPIndexedEdgeIterator, AbstractLMCEDigraph.LMEdgeIterator, AbstractLMGEDigraph.LMEdgeNodeIterator, AbstractMatrixCEDigraph.MatrixEdgeIterator, AbstractMatrixGEDigraph.MatrixEdgeIterator, CEBellmanFordTest.BFCEDigraph.WrappingEdgeIterator, GEBellmanFordTest.BFGEDigraph.WrappingEdgeNodeIterator

public interface IndexedEdgeNodeIterator

extends EdgeNodeIterator

An EdgeNodeIterator with methods to get indicies.

Author:

David Walend dfw1@cornell.edu

Method Summary

int	fromIndex() Returns the index of the node that his edge begins at.
int	toIndex() Returns the index of the node that this edge reaches.

Methods inherited from interface net.walend.digraph.EdgeNodeIterator

fromNode, hasNext, next, remove, toNode

Method Detail

fromIndex

public int fromIndex()

Returns the index of the node that his edge begins at.

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.

toIndex

public int toIndex()

Returns the index of the node that this edge reaches.

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.