net.walend.measured
Class GEBellmanFordTest.BFGEDigraph

java.lang.Object
  |
  +--net.walend.measured.GEBellmanFordTest.BFGEDigraph

All Implemented Interfaces:

Digraph, GEDigraph, HasState, IndexedDigraph, IndexedGEDigraph

Enclosing class:

GEBellmanFordTest

private static final class GEBellmanFordTest.BFGEDigraph

extends java.lang.Object

implements IndexedGEDigraph

This is simply a wrapper of a GEDigraph that has a BFNode and BFEdges from that node to all nodes.

Nested Class Summary

private class	GEBellmanFordTest.BFGEDigraph.NodeIterator
private class	GEBellmanFordTest.BFGEDigraph.WrappingEdgeNodeIterator

Field Summary

private int	bfNodeIndex
private IndexedGEDigraph	digraph
private int[]	nodeIndices

Fields inherited from interface net.walend.digraph.GEDigraph

EMPTY

Constructor Summary

private

GEBellmanFordTest.BFGEDigraph(IndexedGEDigraph digraph)

Method Summary

boolean	containsEdge(int fromIndex, int toIndex)
boolean	containsEdge(java.lang.Object fromNode, java.lang.Object toNode) Returns true if the digraph contains any edge from fromNode to toNode
boolean	containsGEDigraph(GEDigraph digraph) Returns true if digraph is a subgraph of this GEDigraph.
boolean	containsNode(int index)
boolean	containsNode(java.lang.Object node)
boolean	containsNodes(java.util.Set nodes)
int	countInboundEdges(int index)
int	countInboundEdges(java.lang.Object node)
int	countOutboundEdges(int index)
int	countOutboundEdges(java.lang.Object node)
int	edgeCount()
EdgeNodeIterator	edgeNodeIterator() Returns an iterator that iterates across pairs of nodes that make edges.
int[]	getFromIndices(int index)
java.util.Set	getFromNodes(int index)
java.util.Set	getFromNodes(java.lang.Object node) Returns the set of nodes that can reach this node by crossing one edge.
java.lang.Object	getNode(int index)
int	getNodeIndex(java.lang.Object node)
java.util.Set	getNodes()
java.lang.Class	getPrincipleInterface() Returns the class's principle interface for state comparisons.
int[]	getToIndices(int index)
java.util.Set	getToNodes(int index)
java.util.Set	getToNodes(java.lang.Object node) Returns the set of nodes that can be reached from this node by crossing one edge.
IndexedEdgeNodeIterator	indexedEdgeNodeIterator()
IndexedIterator	indexedNodeIterator()
GEDigraph	intersectWithGEDigraph(GEDigraph digraph) Returns a new digraph that is the intersection of this with digraph.
boolean	isEdgeFree() Returns true if this Digraph has no edges.
boolean	isEmpty()
int	nodeCapacity() Returns the maximum capacity for nodes in this IndexedDigraph.
int	nodeCount()
int[]	nodeIndices() Returns an array if ints that show which node indices are being used.
java.util.Iterator	nodeIterator() Implementations should explicitly state how they interpret nodeIterator()'s remove method.
boolean	sameGEDigraphAs(GEDigraph digraph) Returns true if digraph is the same as this; that is, if this.containsGEDigraph(digraph) and digraph.containsGEDigraph(this).
boolean	sameStateAs(HasState victim) If two HasStates have the same internal state, return true.
GEDigraph	unionGEDigraph(GEDigraph digraph) Returns a new digraph that is the union of this with digraph.

Methods inherited from class java.lang.Object

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

Field Detail

digraph

private IndexedGEDigraph digraph

nodeIndices

private int[] nodeIndices

bfNodeIndex

private int bfNodeIndex

Constructor Detail

GEBellmanFordTest.BFGEDigraph

private GEBellmanFordTest.BFGEDigraph(IndexedGEDigraph digraph)

Method Detail

containsGEDigraph

public boolean containsGEDigraph(GEDigraph digraph)

Returns true if digraph is a subgraph of this GEDigraph.

Specified by:

containsGEDigraph in interface GEDigraph

sameGEDigraphAs

public boolean sameGEDigraphAs(GEDigraph digraph)

Returns true if digraph is the same as this; that is, if this.containsGEDigraph(digraph) and digraph.containsGEDigraph(this).

Specified by:

sameGEDigraphAs in interface GEDigraph

intersectWithGEDigraph

public GEDigraph intersectWithGEDigraph(GEDigraph digraph)

Returns a new digraph that is the intersection of this with digraph. Implementations should generally return the same implementation of GEDigraph as they have themselves.

Specified by:

intersectWithGEDigraph in interface GEDigraph

unionGEDigraph

public GEDigraph unionGEDigraph(GEDigraph digraph)

Returns a new digraph that is the union of this with digraph. Implementations should generally return the same implementation of GEDigraph as they are themselves. If the digraphs contain conflicting edges, then (unless you have a better rule) let digraph's edge win out.

Specified by:

unionGEDigraph in interface GEDigraph

nodeCount

public int nodeCount()

Specified by:

nodeCount in interface Digraph

edgeCount

public int edgeCount()

Specified by:

edgeCount in interface Digraph

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Digraph

containsNode

public boolean containsNode(java.lang.Object node)

Specified by:

containsNode in interface Digraph

containsEdge

public boolean containsEdge(java.lang.Object fromNode,
                            java.lang.Object toNode)
                     throws NodeMissingException

Returns true if the digraph contains any edge from fromNode to toNode

Specified by:

containsEdge in interface Digraph

Throws:

NodeMissingException - if either node is missing from the digraph.

countInboundEdges

public int countInboundEdges(java.lang.Object node)
                      throws NodeMissingException

Specified by:

countInboundEdges in interface Digraph

Throws:

NodeMissingException - if node is not in the digraph.

countOutboundEdges

public int countOutboundEdges(java.lang.Object node)
                       throws NodeMissingException

Specified by:

countOutboundEdges in interface Digraph

Throws:

NodeMissingException - if node is not in the digraph.

getFromNodes

public java.util.Set getFromNodes(java.lang.Object node)
                           throws NodeMissingException

Returns the set of nodes that can reach this node by crossing one edge.

Specified by:

getFromNodes in interface Digraph

Throws:

NodeMissingException - if node is not in the digraph.

getFromIndices

public int[] getFromIndices(int index)

Specified by:

getFromIndices in interface IndexedDigraph

getToNodes

public java.util.Set getToNodes(java.lang.Object node)
                         throws NodeMissingException

Returns the set of nodes that can be reached from this node by crossing one edge.

Specified by:

getToNodes in interface Digraph

Throws:

NodeMissingException - if node is not in the digraph.

getToIndices

public int[] getToIndices(int index)

Specified by:

getToIndices in interface IndexedDigraph

nodeIterator

public java.util.Iterator nodeIterator()

Implementations should explicitly state how they interpret nodeIterator()'s remove method. It should either throw an UnsupportedOperationException or cause a hidden side effects of removing edges.

Specified by:

nodeIterator in interface Digraph

edgeNodeIterator

public EdgeNodeIterator edgeNodeIterator()

Returns an iterator that iterates across pairs of nodes that make edges.

Specified by:

edgeNodeIterator in interface Digraph

getNodes

public java.util.Set getNodes()

Specified by:

getNodes in interface Digraph

isEdgeFree

public boolean isEdgeFree()

Returns true if this Digraph has no edges.

Specified by:

isEdgeFree in interface Digraph

containsNodes

public boolean containsNodes(java.util.Set nodes)

Specified by:

containsNodes in interface Digraph

nodeCapacity

public int nodeCapacity()

Returns the maximum capacity for nodes in this IndexedDigraph.

Specified by:

nodeCapacity in interface IndexedDigraph

nodeIndices

public int[] nodeIndices()

Returns an array if ints that show which node indices are being used.

Specified by:

nodeIndices in interface IndexedDigraph

containsNode

public boolean containsNode(int index)

Specified by:

containsNode in interface IndexedDigraph

Throws:

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

getNode

public java.lang.Object getNode(int index)

Specified by:

getNode in interface IndexedDigraph

Throws:

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

getNodeIndex

public int getNodeIndex(java.lang.Object node)
                 throws NodeMissingException

Specified by:

getNodeIndex in interface IndexedDigraph

Throws:

a - NodeMissingException if the node is not in the digraph.

NodeMissingException

containsEdge

public boolean containsEdge(int fromIndex,
                            int toIndex)

Specified by:

containsEdge in interface IndexedDigraph

Throws:

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

countInboundEdges

public int countInboundEdges(int index)

Specified by:

countInboundEdges in interface IndexedDigraph

Throws:

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

countOutboundEdges

public int countOutboundEdges(int index)

Specified by:

countOutboundEdges in interface IndexedDigraph

Throws:

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

getFromNodes

public java.util.Set getFromNodes(int index)

Specified by:

getFromNodes in interface IndexedDigraph

Throws:

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

getToNodes

public java.util.Set getToNodes(int index)

Specified by:

getToNodes in interface IndexedDigraph

Throws:

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

indexedEdgeNodeIterator

public IndexedEdgeNodeIterator indexedEdgeNodeIterator()

Specified by:

indexedEdgeNodeIterator in interface IndexedDigraph

indexedNodeIterator

public IndexedIterator indexedNodeIterator()

Specified by:

indexedNodeIterator in interface IndexedDigraph

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

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