From: JOUBERT Antoine <[EMAIL PROTECTED]> > 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 _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
