From: martin85 <vic...@gm...> - 2012-10-07 13:28:08
|
I had exactly the same problem with my graph using kshort alg, error message saying : "graph must contain the start vertex". CrossComponentIterator:170 -> constructor CrossComponentIterator(Graph<V, E> g, V startVertex) My graph is huge so i dont know how to write small junit test for you guys - i will propably try to generate some small random graphs and i hope it will trigger that bug. As a workaround i commented that illegalarg exception and algorithm "works fine" but obviously it`s tricky. Before bug will be pointed out and hopefully fixed, are there any alernative java libraries which implements k-shortest-path algoritm ? Thanks -- View this message in context: http://jgrapht-users.107614.n3.nabble.com/Re-JGraphT-Enquiry-KShortestPaths-Bug-tp4024711p4024733.html Sent from the jgrapht-users mailing list archive at Nabble.com. |