net.walend.digraph
Interface IndexedCEDigraph

All Superinterfaces:

CEDigraph, Digraph, HasState, IndexedDigraph

All Known Subinterfaces:

DigraphOfCEPaths, DigraphOfGEPaths, IndexedMutableCEDigraph, MutableDigraphOfCEPaths, MutableDigraphOfGEPaths, ShortestCEPaths, ShortestGEPaths

All Known Implementing Classes:

AbstractDelegateDigraphOfCEPaths, AbstractDelegateDigraphOfGEPaths, AbstractMatrixCEDigraph, AbstractShortestCEPaths, AbstractShortestGEPaths, CEBellmanFordTest, CEBellmanFordTest.BFCEDigraph, CEPathsFromShortestDistances, DijkstraShortestCEPaths, DijkstraShortestGEPaths, FloydWarshallShortestCEPaths, FloydWarshallShortestGEPaths, GEBellmanFordTest, JITShortestCEPaths, JITShortestGEPaths, JohnsonShortestCEPaths, JohnsonShortestGEPaths, MutableLMCEDigraph, MutableMatrixCEDigraph

public interface IndexedCEDigraph

extends IndexedDigraph, CEDigraph

CEDigraph methods that use indices.

Author:

David Walend dfw1@cornell.edu

Field Summary

Fields inherited from interface net.walend.digraph.CEDigraph

EMPTY

Method Summary

boolean	containsEdge(int fromIndex, int toIndex, java.lang.Object edge)
java.lang.Object	getEdge(int fromIndex, int toIndex)
Bag	getInboundEdges(int index)
Bag	getOutboundEdges(int index)
IndexedEdgeIterator	indexedEdgeIterator()

Methods inherited from interface net.walend.digraph.IndexedDigraph

containsEdge, containsNode, countInboundEdges, countOutboundEdges, getFromIndices, getFromNodes, getNode, getNodeIndex, getToIndices, getToNodes, indexedEdgeNodeIterator, indexedNodeIterator, nodeCapacity, nodeIndices

Methods inherited from interface net.walend.digraph.Digraph

containsEdge, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getFromNodes, getNodes, getToNodes, isEdgeFree, isEmpty, nodeCount, nodeIterator

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Methods inherited from interface net.walend.digraph.CEDigraph

containsCEDigraph, containsEdge, edgeIterator, getEdge, getEdges, getInboundEdges, getOutboundEdges, intersectWithCEDigraph, sameCEDigraphAs, unionCEDigraph

Method Detail

containsEdge

public boolean containsEdge(int fromIndex,
                            int toIndex,
                            java.lang.Object edge)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

getInboundEdges

public Bag getInboundEdges(int index)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

getOutboundEdges

public Bag getOutboundEdges(int index)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

getEdge

public java.lang.Object getEdge(int fromIndex,
                                int toIndex)

Throws:

java.lang.ArrayIndexOutOfBoundsException - if index does not have a node. Use nodeIndicies() or getNodeIndex() to avoid these. In your code, catch ArrayIndexOutOfBoundsException and throw a ConcurrentModificationException if you think that's the problem.

indexedEdgeIterator

public IndexedEdgeIterator indexedEdgeIterator()