net.walend.digraph.path
Class ListCEPath

java.lang.Object
  |
  +--net.walend.digraph.path.AbstractListCEPath
        |
        +--net.walend.digraph.path.ListCEPath

All Implemented Interfaces:

CEDigraph, CEPath, Digraph, HasState, net.walend.enum.Immutable, Path, java.io.Serializable

public final class ListCEPath

extends AbstractListCEPath

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

This class implements the CEPath interface using two lists.

Since:

20010613

Author:

David Walend dfw1@cornell.edu

See Also:

Serialized Form

Nested Class Summary

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

AbstractListCEPath.ListEdgeIterator

Field Summary

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

Fields inherited from interface net.walend.digraph.CEDigraph

EMPTY

Constructor Summary

ListCEPath(CEDigraph 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.

ListCEPath(CEPath path)

ListCEPath(CEPath path, java.util.List nodeList, java.util.List edgeList)

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

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

Methods inherited from class java.lang.Object

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

Constructor Detail

ListCEPath

public ListCEPath(CEPath path)

ListCEPath

public ListCEPath(CEPath path,
                  java.util.List nodeList,
                  java.util.List edgeList)

ListCEPath

public ListCEPath(CEDigraph 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).