17 Jul
2012
17 Jul
'12
3:36 p.m.
I'll add a second -- this would be highly useful for some of our applications. THK On Mon, Jul 16, 2012 at 2:48 PM, Jeremiah Willcock <jewillco@osl.iu.edu> wrote:
On Mon, 16 Jul 2012, Alex Hagen-Zanker wrote:
On 13/07/2012 19:24, Jeremiah Willcock wrote:
On Fri, 13 Jul 2012, Alex Hagen-Zanker wrote:
I placed the BGL algorithm of the dijkstra_shortest_path in a class, with the creation and initialization part separate from the main algorithm. This allows interrupting, resetting and resuming the algorithm. Would this be of interest to anybody?
<snip>
-- Timothy H. Keitt http://www.keittlab.org/