Re: GraphStream shortest path question

[Antoine Dutot <antoine.dutot AT gmail.com>]

Hi Pavel,

That's a pity for a dynamic graph library, but there is no dynamic A* (D* for example) implementation yet ! It is on the to-do list, but sadly none of us have yet started to work on it.

Very sorry,

Antoine

2011/10/11 Pavel Menshchikov <PMenshchikov AT airdata.co.uk>

 

I’m currently looking into the GraphStream library (I’m interested in finding shortest paths in a dynamic graph), but it looks like in the version/release 1.0 there’s no support for dynamic graphs in any of the shortest path searches. Am I correct? If yes, by any chance do you have maybe a draft implementation of A* or Dijkstra algorithms for dynamic graphs that you haven’t included in the last release and which you could share with me? I’d appreciate it very much, as I’m not into theoretical math very much and implementing an algorithm would be too much of a challenge for me J.

 

Thank you.

 

 

--

Pavel Menshchikov

 

*** This communication has been sent from World Fuel Services
Corporation or its subsidiaries or its affiliates for the intended recipient
only and may contain proprietary, confidential or privileged information.
If you are not the intended recipient, any review, disclosure, copying,
use, or distribution of the information included in this communication
and any attachments is strictly prohibited. If you have received this
communication in error, please notify us immediately by replying to this
communication and delete the communication, including any
attachments, from your computer. Electronic communications sent to or
from World Fuel Services Corporation or its subsidiaries or its affiliates
may be monitored for quality assurance and compliance purposes.***