Dynamic Algorithms regarding.

[<rahman.hafeezul AT gmail.com>]

Hi,
  Is there a dynamic shortest path algorithm in the current latest release
version of GraphStream library? i.e It should not recompute the entire 
shortest
path algorithm from the beginning in case a new node or edge is added to the
graph. It should be able to identify which nodes and edges were changed and
then provide the new updated shortest path between the required nodes.

  I found an implementation of an algorithm in 'NetworkSimplex' by the name -
DynamicOneToAllShortestPath.java that is available in the version 1.3 of the
library, but there is no documentation or sample examples for this which would
inform me that these is a dynamic Shortest Path algorithm and that the
computations required for finding the shortest path are not done altogether
from scratch. Can you people please clarify?

Regards,
Rahman.