net.walend.digraph.path
Class ListUEPath

java.lang.Object
  |
  +--net.walend.digraph.path.AbstractListUEPath
        |
        +--net.walend.digraph.path.ListUEPath

All Implemented Interfaces:

Digraph, HasState, net.walend.enum.Immutable, Path, java.io.Serializable, UEDigraph, UEPath

public final class ListUEPath

extends AbstractListUEPath

implements net.walend.enum.Immutable, java.io.Serializable

This class implements the UEPath interface using two lists.

Author:

David Walend dfw1@cornell.edu

See Also:

Serialized Form

Nested Class Summary

Nested classes inherited from class net.walend.digraph.path.AbstractListUEPath

AbstractListUEPath.ListEdgeIterator

Field Summary

Fields inherited from class net.walend.digraph.path.AbstractListUEPath

Fields inherited from interface net.walend.digraph.UEDigraph

EMPTY

Constructor Summary

ListUEPath(UEDigraph digraph, java.util.List nodeList, java.util.List edgeList)
Creates a new path on digraph that has only node in it, using nodeListn and edgeList.

ListUEPath(UEPath path)

ListUEPath(UEPath path, java.util.List nodeList, java.util.List edgeList)

Methods inherited from class net.walend.digraph.path.AbstractListUEPath

addToHead, addToTail, checkValid, chopList, containsEdge, containsEdge, containsEdge, containsEdges, containsNode, containsNodes, containsUEDigraph, countInboundEdges, countOutboundEdges, edgeCount, edgeIterator, edgeNodeIterator, getEdge, getEdgeAtIndex, getEdgeList, getEdges, getFromNode, getFromNodes, getHead, getInboundEdges, getIndexOfEdge, getIndexOfNode, getLastIndexOfEdge, getLastIndexOfNode, getNodeAtIndex, getNodeList, getNodes, getOutboundEdges, getPrincipleInterface, getSubpath, getSubpathFirst, getSubpathFirstToLast, getSubpathLast, getSubpathLastToFirst, getSupergraph, getTail, getToNode, getToNodes, graftToHead, graftToTail, intersectWithUEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, pathEdgeCount, pathEdgeIterator, pathEdgeNodeIterator, pathNodeCount, pathNodeIterator, pruneHead, pruneHeadFromFirst, pruneHeadFromLast, pruneTail, pruneTailFromFirst, pruneTailFromLast, removeHead, removeTail, sameStateAs, sameUEDigraphAs, sameUEPathAs, splice, spliceFirst, spliceFirstToLast, spliceLast, spliceLastToFirst, toString, unionUEDigraph, valid

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

ListUEPath

public ListUEPath(UEPath path)

ListUEPath

public ListUEPath(UEPath path,
                  java.util.List nodeList,
                  java.util.List edgeList)

ListUEPath

public ListUEPath(UEDigraph digraph,
                  java.util.List nodeList,
                  java.util.List edgeList)

Creates a new path on digraph that has only node in it, using nodeListn and edgeList. This constructor uses nodeList as the list of nodes, and edgeList as the list of edges.

Throws:

InvalidPathException - if the path is not valid (because the node isn't in the supergraph).