infovis.graph.algorithm
Class DijkstraShortestPath

java.lang.Object
  infovis.graph.algorithm.Algorithm
      infovis.graph.algorithm.DijkstraShortestPath

public class DijkstraShortestPath
extends Algorithm

Class DijkstraShortestPath

Version:

$Revision: 1.6 $

Author:

Jean-Daniel Fekete

Nested Class Summary

static class

DijkstraShortestPath.Predecessor

Field Summary

Fields inherited from class infovis.graph.algorithm.Algorithm

BLACK, GREY, WHITE

Constructor Summary

DijkstraShortestPath(Graph graph)

DijkstraShortestPath(Graph graph, boolean cached)

DijkstraShortestPath(Graph graph, NumberColumn edgeWeights, boolean cached)

Method Summary

static DoubleMatrix2D	allShortestPaths(Graph graph, NumberColumn edgeWeights, DoubleMatrix2D matrix)
OpenIntObjectHashMap	allShortestPaths(int from)
double	getEdgeWeight(int edge)
static int	getPred(Object o)
DijkstraShortestPath.Predecessor	getPredecessor(int from, DijkstraShortestPath.Predecessor p)
static int	getVertex(Object o)
static double	getWeight(Object o)
boolean	isCached()
void	setCached(boolean cached)
DijkstraShortestPath.Predecessor	shortestPath(int from, int to)

Methods inherited from class java.lang.Object

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

Constructor Detail

DijkstraShortestPath

public DijkstraShortestPath(Graph graph,
                            NumberColumn edgeWeights,
                            boolean cached)

DijkstraShortestPath

public DijkstraShortestPath(Graph graph,
                            boolean cached)

DijkstraShortestPath

public DijkstraShortestPath(Graph graph)

Method Detail

allShortestPaths

public static DoubleMatrix2D allShortestPaths(Graph graph,
                                              NumberColumn edgeWeights,
                                              DoubleMatrix2D matrix)

isCached

public boolean isCached()

setCached

public void setCached(boolean cached)

getEdgeWeight

public double getEdgeWeight(int edge)

shortestPath

public DijkstraShortestPath.Predecessor shortestPath(int from,
                                                     int to)

allShortestPaths

public OpenIntObjectHashMap allShortestPaths(int from)

getWeight

public static double getWeight(Object o)

getVertex

public static int getVertex(Object o)

getPred

public static int getPred(Object o)

getPredecessor

public DijkstraShortestPath.Predecessor getPredecessor(int from,
                                                       DijkstraShortestPath.Predecessor p)