net.walend.measured
Class AbstractShortestGEPaths.DigraphMeasuredGEPath

java.lang.Object
  |
  +--net.walend.digraph.path.AbstractDelegateDigraphOfGEPaths.DigraphGEPath
        |
        +--net.walend.measured.AbstractShortestGEPaths.DigraphMeasuredGEPath

All Implemented Interfaces:

Digraph, GEDigraph, GEPath, HasState, MeasuredGEPath, Path

Enclosing class:

AbstractShortestGEPaths

private class AbstractShortestGEPaths.DigraphMeasuredGEPath

extends AbstractDelegateDigraphOfGEPaths.DigraphGEPath

implements MeasuredGEPath

Nested Class Summary

Nested classes inherited from class net.walend.digraph.path.AbstractDelegateDigraphOfGEPaths.DigraphGEPath

AbstractDelegateDigraphOfGEPaths.DigraphGEPath.PathEdgeNodeIterator

Field Summary

private int	length
private GEPathMeter	pathMeter

Fields inherited from class net.walend.digraph.path.AbstractDelegateDigraphOfGEPaths.DigraphGEPath

Fields inherited from interface net.walend.digraph.GEDigraph

EMPTY

Constructor Summary

AbstractShortestGEPaths.DigraphMeasuredGEPath(java.lang.Object head, AbstractShortestGEPaths.MeasuredEdge edge, java.lang.Object tail, AbstractShortestGEPaths container)

Method Summary

int	getLength()
java.lang.Class	getPrincipleInterface() Returns the class's principle interface for state comparisons.
boolean	sameStateAs(HasState victim) If two HasStates have the same internal state, return true.
java.lang.String	toString()
boolean	valid() Returns true if this path is still a subgraph of its supergraph

Methods inherited from class net.walend.digraph.path.AbstractDelegateDigraphOfGEPaths.DigraphGEPath

containsEdge, containsGEDigraph, containsNode, containsNodes, countInboundEdges, countOutboundEdges, edgeCount, edgeNodeIterator, getFromNodes, getHead, getIndexOfNode, getLastIndexOfNode, getNeck, getNodeAtIndex, getNodeList, getNodes, getSubpath, getSubpathFirst, getSubpathFirstToLast, getSubpathLast, getSubpathLastToFirst, getSupergraph, getTail, getToNodes, intersectWithGEDigraph, isEdgeFree, isEmpty, nodeCount, nodeIterator, pathEdgeCount, pathEdgeNodeIterator, pathNodeCount, pathNodeIterator, sameGEDigraphAs, sameGEPathAs, unionGEDigraph

Methods inherited from class java.lang.Object

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

Methods inherited from interface net.walend.digraph.path.GEPath

getSubpath, getSubpathFirst, getSubpathFirstToLast, getSubpathLast, getSubpathLastToFirst, getSupergraph, sameGEPathAs

Methods inherited from interface net.walend.digraph.GEDigraph

containsGEDigraph, intersectWithGEDigraph, sameGEDigraphAs, unionGEDigraph

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.digraph.path.Path

getHead, getIndexOfNode, getLastIndexOfNode, getNodeAtIndex, getNodeList, getTail, pathEdgeCount, pathEdgeNodeIterator, pathNodeCount, pathNodeIterator

Field Detail

length

private int length

pathMeter

private GEPathMeter pathMeter

Constructor Detail

AbstractShortestGEPaths.DigraphMeasuredGEPath

public AbstractShortestGEPaths.DigraphMeasuredGEPath(java.lang.Object head,
                                                     AbstractShortestGEPaths.MeasuredEdge edge,
                                                     java.lang.Object tail,
                                                     AbstractShortestGEPaths container)

Method Detail

getLength

public int getLength()

Specified by:

getLength in interface MeasuredGEPath

valid

public boolean valid()

Returns true if this path is still a subgraph of its supergraph

Specified by:

valid in interface Path

Overrides:

valid in class AbstractDelegateDigraphOfGEPaths.DigraphGEPath

getPrincipleInterface

public java.lang.Class getPrincipleInterface()

Description copied from interface: HasState

Returns the class's principle interface for state comparisons. If two objects have different principle interfaces, they never have the same state.

Specified by:

getPrincipleInterface in interface HasState

Overrides:

getPrincipleInterface in class AbstractDelegateDigraphOfGEPaths.DigraphGEPath

sameStateAs

public boolean sameStateAs(HasState victim)

Description copied from interface: HasState

If two HasStates have the same internal state, return true.

For objects with subobjects, Generally this method should only return true if the internal objects are equal. Implement a contentsHaveSameState() method to determine if the contents have the same state.

Specified by:

sameStateAs in interface HasState

Overrides:

sameStateAs in class AbstractDelegateDigraphOfGEPaths.DigraphGEPath

toString

public java.lang.String toString()

Overrides:

toString in class AbstractDelegateDigraphOfGEPaths.DigraphGEPath