|
From: John V. S. <js...@gm...> - 2010-02-01 04:43:42
|
Andrea, thanks for the test case. There was indeed a bug, which it turns out was already fixed in the latest code in Subversion as part of Soren Davidsen's rewrite of the algorithm implementation to make it more efficient. The fix will be included in the next release of JGraphT. I'm adding your test case to the unit test suite. JVS John V. Sichi wrote: > andrea pagani wrote: >> Hello everybody, >> >> I'm very new to JgraphT and to this mailinglist too. >> I'm trying to compute the diamater of a very simple graph: >> ?ui=2&view=att&th=126657e30cb18cc8&attid=0.1&disp=attd&realattid=ii_126657e30cb18cc8&zw >> >> >> using the FloydWarshallShortestPaths<V,E> class and getDiameter() method. >> It returns me infinity, that is not correct....is there something I'm >> missing? >> >> Thank you very much in advance. > > Could be a bug, but it would help if you submitted the Java code for > your unit test so that we can reproduce it, debug/fix, and then make > sure it stays fixed by including your test in the suite. > > JVS > |
