net.walend.measured
Class DijkstraShortestCEDistances

java.lang.Object
  |
  +--net.walend.measured.AbstractShortestCEDistances
        |
        +--net.walend.measured.DijkstraShortestCEDistances

All Implemented Interfaces:

HasState, java.io.Serializable, ShortestCEDistances

Direct Known Subclasses:

JITShortestCEDistances, JohnsonShortestCEDistances

public abstract class DijkstraShortestCEDistances

extends AbstractShortestCEDistances

implements ShortestCEDistances, java.io.Serializable

DijkstraShortestCEDistances is an abstract class that holds Dijkstra's algorithm.

Author:

David Walend dfw1@cornell.edu

See Also:

Serialized Form

Nested Class Summary

private class

DijkstraShortestCEDistances.HeapNode

Field Summary

private DijkstraShortestCEDistances.HeapNode[]

heapNodes

Fields inherited from class net.walend.measured.AbstractShortestCEDistances

Constructor Summary

DijkstraShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)

Method Summary

protected DijkstraShortestCEDistances.HeapNode	createNode(java.lang.Object wrappedNode, int index)
protected void	dijkstra(int endIndex) Find all of the shortest paths to the node at endIndex.
protected void	initWithNodesFrom(IndexedCEDigraph digraph)

Methods inherited from class net.walend.measured.AbstractShortestCEDistances

bfTest, getBase, getLength, getLength, getPathMeter, getPrincipleInterface, initializeDistances, recalculate, relax, safeLength, sameStateAs, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface net.walend.measured.ShortestCEDistances

getBase, getLength, getLength, getPathMeter, recalculate

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Field Detail

heapNodes

private DijkstraShortestCEDistances.HeapNode[] heapNodes

Constructor Detail

DijkstraShortestCEDistances

public DijkstraShortestCEDistances(IndexedCEDigraph ceDigraph,
                                   CEPathMeter pathMeter)
                            throws CENegativeWeightCycleException

Method Detail

initWithNodesFrom

protected void initWithNodesFrom(IndexedCEDigraph digraph)

createNode

protected DijkstraShortestCEDistances.HeapNode createNode(java.lang.Object wrappedNode,
                                                          int index)

dijkstra

protected void dijkstra(int endIndex)

Find all of the shortest paths to the node at endIndex.

Parameters:

endIndex -