Subject: Re: [boost] How to speed up the djikstra graph
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-05-22 08:02:38
> Optimally the graph should be persistant and allow me to dynamically add /
> remove provinces and change the cost of the edges every hour (as I
> understand it the boost library allows that right now with vertex_clear /
> add etc.), and giving new values without recomputing every single edge in
> the graph 300 times every hour.
> Is that possible? And if how would that be done?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk