On 07/11/2014 02:08 PM, Gareth Simons wrote: > Is it possible that once the algorithm reaches an edge that exceeds > the cutoff distance, that it stops then-and-there, instead of > searching the remaining vertices?
Yes, this is indeed a bug! This works fine for DFS, but for Dijkstra it gives the wrong result. I have just corrected this in the git version. Could you please try it and see if it is working as expected for you? Thanks for spotting this and for the working example. Best, Tiago -- Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
