Re: [jgrapht-users] DijkstraShortestPath
Brought to you by:
barak_naveh,
perfecthash
From: John V. S. <js...@gm...> - 2006-09-03 17:04:49
|
Anderson Adolfs wrote: > Could you explain what this "retroweaver-generated > backport" means ? Maybe It can help me. I need to use > Bellman-Ford provided with 0.7.0, but like Dijkstra's > Algorithm implementation, It doesn't work like was in > 0.6.0. To try to keep JGraphT useful to users stuck on JDK 1.4, we added a backport using Retroweaver: http://retroweaver.sourceforge.net As I mentioned in a previous post, the README.html file included with the JGraphT distribution explains which jar to use in which circumstances. > P.S.: LabeledElement was not unuseful =/ That must be why so many people kept posting to ask why it existed :) With the advent of generics, it was definitely obsolete. But if you're prevented from using generics, you can always just privately define the old interface yourself. JVS |