From: guille l. <gui...@gm...> - 2009-12-14 17:44:04
|
thanks for the response, 2009/12/14 Joshua O'Madadhain <jos...@gm...>: > JUNG doesn't support this: there are an exponential number of such paths. ok, thanks. I know there are exponential number of paths, I just want to test it in several relatively small and sparse graphs. > What problem are you trying to solve? it is not for a concrete problem, i just need to get all paths between two given vertexs and then do some computations for each path. Again, regardless of its complexity, i'm just interested in doing it, as: http://www.itl.nist.gov/div897/sqg/dads/HTML/allSimplePaths.html guille |