From: Joel Young (jdy_at_[hidden])
Date: 2003-07-28 07:13:55
From: JOUBERT Antoine <antoine.joubert_at_[hidden]>
> I want a shortest path calculation from several starting point . I
> could of course reapply the dijkstra for every starting point, but i
> would rather initialize Disjkstra with a container of vertex .
If I understand you correctly, I did this by adding a ghost root node
with edges from the root node to each of the true root nodes.
Start the search from the ghost.
Joel