[Jung-support] [Open Discussion] questions about DijkstraShortestPath

[SourceForge.net <no...@so...>]

The following forum message was posted by scutaru at http://sourceforge.net/projects/jung/forums/forum/252062/topic/4582596:

Hi,
I intend to create a Google AppEngine application where to use a graph
and DijkstraShortestPath to calculate the shortest path between 2 nodes.

I would like to minimize the time spent by the DijkstraShortestPath algorithm
by saving the underlying data to Google DataStore ) and reload it again when
my application is loaded back. Do you know if this is possible ?

Also, another limitation of Google AppEngine is that it doesn't allow a process
to run more than 30 seconds. In case the DijkstraShortestPath algorithm takes
more than that to compute, is there a way to save the intermediary results and
start later from there ?

Thank you !