net.walend.measured
Class DijkstraShortestGEDistances

java.lang.Object
  |
  +--net.walend.measured.AbstractShortestGEDistances
        |
        +--net.walend.measured.DijkstraShortestGEDistances

All Implemented Interfaces:

HasState, java.io.Serializable, ShortestGEDistances

Direct Known Subclasses:

JITShortestGEDistances, JohnsonShortestGEDistances

public abstract class DijkstraShortestGEDistances

extends AbstractShortestGEDistances

implements ShortestGEDistances, java.io.Serializable

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

Author:

David Walend dfw1@cornell.edu

See Also:

Serialized Form

Nested Class Summary

private class

DijkstraShortestGEDistances.HeapNode

Field Summary

private DijkstraShortestGEDistances.HeapNode[]

heapNodes

Fields inherited from class net.walend.measured.AbstractShortestGEDistances

Constructor Summary

DijkstraShortestGEDistances(IndexedGEDigraph ceDigraph, GEPathMeter pathMeter)

Method Summary

protected DijkstraShortestGEDistances.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(IndexedGEDigraph digraph)

Methods inherited from class net.walend.measured.AbstractShortestGEDistances

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.ShortestGEDistances

getBase, getLength, getLength, getPathMeter, recalculate

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Field Detail

heapNodes

private DijkstraShortestGEDistances.HeapNode[] heapNodes

Constructor Detail

DijkstraShortestGEDistances

public DijkstraShortestGEDistances(IndexedGEDigraph ceDigraph,
                                   GEPathMeter pathMeter)
                            throws GENegativeWeightCycleException

Method Detail

initWithNodesFrom

protected void initWithNodesFrom(IndexedGEDigraph digraph)

createNode

protected DijkstraShortestGEDistances.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 -