Hi,
I'm trying to find the shortest path on directed graph and i can't! there are two constructors for DijkstraShortestPathFinder:
1- DijkstraShortestPathFinder(graph.getGraph(), sourceN, weighter)
it seems that this one doesn't create a directed shortest path. (i defines the graph as a BasicDirectedLineGraphGenerator).
2- DijkstraShortestPathFinder(graph.getGraph(),Iterator);
and i defined iterator as DirectedDijkstraIterator.
The problem with this one there is no source node, so when i call
dijkstra.calculate() and
dijkstra.getPath(destinationN)
dijkstra.getPath(destinationN)
there is no way to specify the source (and the programs returns nothing).
Can anyone help me pleeeeeeeeeeeeeeeeeeeeeeeeeeeeeae?
thanks
Talk is cheap. Use Yahoo! Messenger to make PC-to-Phone calls. Great rates starting at 1ยข/min.
All the advantages of Linux Managed Hosting--Without the Cost and Risk! Fully trained technicians. The highest number of Red Hat certifications in the hosting industry. Fanatical Support. Click to learn more http://sel.as-us.falkag.net/sel?cmd=lnk&kid=107521&bid=248729&dat=121642
_______________________________________________ Geotools-gt2-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
