[jgrapht-users] DijkstraShortestPath

[Anderson A. <and...@ya...>]

   Hello All,

   Does anybody could provide an example of using
BellmanFordShortestPath?

   There is a plugin of a GIS application using
version 0.6 of JGraphT that uses DijkstraShortestPath
using the codeline:

   List
list=DijkstraShortestPath.findPathBetween(graph,
nodeI, nodeF); /* nodeI and F are objects of a simple
class with getCoordinate() method implemented by an
interface INode; */

   But now, when using the same code, with 0.7 JGraphT
jar jgrapht-jdk1.4.jar, a compiletime error is ocurred
saying that "The method findPathBetween(Graph, Object,
Object) in the type DijkstraShortestPath is not
applicaple for the arguments (Graph, INode, INode)"

   What I need to understand to make this code
possible with 0.7 JGraphT lib ?

   ---

   Thanks.
   Anderson.

   ---

__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around 
http://mail.yahoo.com