-----Original Message----- From: JOUBERT Antoine Sent: 28 July 2003 12:09 To: '[EMAIL PROTECTED]' Subject: Dijkstra with several starting point
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 . So instead of initialize d[firstPoint]=0 I would for(all point in starting list ) d[point]=0 I need some advice , I have tried adding in dijkstra and in bfs some thing like ( vector<vertex> ) but it is not working Thanks for some help ____ This message and any files transmitted with it are legally privileged and intended for the sole use of the individual(s) or entity to whom they are addressed. If you are not the intended recipient, please notify the sender by reply and delete the message and any attachments from your system. Any unauthorised use or disclosure of the content of this message is strictly prohibited and may be unlawful. Nothing in this e-mail message amounts to a contractual or legal commitment on the part of EUROCONTROL unless it is confirmed by appropriately signed hard copy. Any views expressed in this message are those of the sender. ____ This message and any files transmitted with it are legally privileged and intended for the sole use of the individual(s) or entity to whom they are addressed. If you are not the intended recipient, please notify the sender by reply and delete the message and any attachments from your system. Any unauthorised use or disclosure of the content of this message is strictly prohibited and may be unlawful. Nothing in this e-mail message amounts to a contractual or legal commitment on the part of EUROCONTROL unless it is confirmed by appropriately signed hard copy. Any views expressed in this message are those of the sender. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
