net.sf.jsort.graph
Class DijkstraPath

java.lang.Object
  net.sf.jsort.graph.DijkstraPath

All Implemented Interfaces:

AlgorithmPath

public class DijkstraPath
extends java.lang.Object
implements AlgorithmPath

This class implements a edge "sort" algorithm. It compute the minimal path between two vertex in a directed graph, using the Dijsktra algorithm. The constraint over the graph is that all weigth must be positive (using the required precision).

Author:

Domingos Creado

Constructor Summary

DijkstraPath()

Method Summary

java.util.Map	getPath(edu.uci.ics.jung.graph.Graph graph, edu.uci.ics.jung.graph.Vertex source, java.util.Collection targets, WeightResolver weightResolver)
Path	getPath(edu.uci.ics.jung.graph.Graph graph, edu.uci.ics.jung.graph.Vertex source, edu.uci.ics.jung.graph.Vertex target, WeightResolver weightResolver)

Methods inherited from class java.lang.Object

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

Constructor Detail

DijkstraPath

public DijkstraPath()

Method Detail

getPath

public Path getPath(edu.uci.ics.jung.graph.Graph graph,
                    edu.uci.ics.jung.graph.Vertex source,
                    edu.uci.ics.jung.graph.Vertex target,
                    WeightResolver weightResolver)

Specified by:

getPath in interface AlgorithmPath

getPath

public java.util.Map getPath(edu.uci.ics.jung.graph.Graph graph,
                             edu.uci.ics.jung.graph.Vertex source,
                             java.util.Collection targets,
                             WeightResolver weightResolver)

Specified by:

getPath in interface AlgorithmPath