net.walend.digraph.path
Interface DigraphOfGEPaths

All Superinterfaces:

CEDigraph, Digraph, HasState, IndexedCEDigraph, IndexedDigraph

All Known Subinterfaces:

MutableDigraphOfGEPaths, ShortestGEPaths

All Known Implementing Classes:

AbstractDelegateDigraphOfGEPaths, AbstractShortestGEPaths, DijkstraShortestGEPaths, FloydWarshallShortestGEPaths, GEBellmanFordTest, JITShortestGEPaths, JohnsonShortestGEPaths

public interface DigraphOfGEPaths

extends IndexedCEDigraph

DigraphOfGEPaths is a CEDigraph containing the nodes from a base digraph and edges that are paths through the base digraph between these nodes.

In general, constructors will have a base digraph and perhaps an underlying MutableUEDigraph or another DigraphOfCEPaths to use as parameters.

Author:

David Walend dfw1@cornell.edu

Field Summary

Fields inherited from interface net.walend.digraph.CEDigraph

EMPTY

Method Summary

IndexedGEDigraph	getBase()
GEPath	getPath(int fromIndex, int toIndex)
GEPath	getPath(java.lang.Object fromNode, java.lang.Object toNode)
boolean	valid() Checks to make sure all the nodes and edges in the path still exist in the base digraph.

Methods inherited from interface net.walend.digraph.IndexedCEDigraph

containsEdge, getEdge, getInboundEdges, getOutboundEdges, 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

getPath

public GEPath getPath(java.lang.Object fromNode,
                      java.lang.Object toNode)
               throws NodeMissingException

NodeMissingException

getPath

public GEPath getPath(int fromIndex,
                      int toIndex)

valid

public boolean valid()

Checks to make sure all the nodes and edges in the path still exist in the base digraph.

getBase

public IndexedGEDigraph getBase()