net.sf.jsort.graph
Interface AlgorithmPath

All Known Implementing Classes:
DijkstraPath

public interface AlgorithmPath

This interface is the interface of all algorithm that deals with path calculation. See each implementation about constraints over the graph. All numeric calculations are externalized from the algorithm, using the WeightResolver, that let all numeric operation be done as the precision required by the usage.

Author:
Domingos Creado

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)
           
 

Method Detail

getPath

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)

getPath

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


Copyright © 2005-2008 Domingos Creado. All Rights Reserved.