jgrapht-users

[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 

Re: [jgrapht-users] DijkstraShortestPath

[John V. S. <js...@gm...>]

Anderson Adolfs wrote:
>    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 ?

First, please go over the README.html file included in the JGraphT 
distribution.  The section on "Getting Started" covers the supported 
JDK/JRE combinations.  It sounds like there may be a problem with the 
retroweaver-generated backport, but I'd have to see a reproducible test 
case before I could tell you more.  Depending on your deployment 
constraints, you may be able to use jgrapht-jdk1.5.jar instead.

JVS