Thanks Tiago. 

A quick question as a newb to Linux: If I install from git onto Ubuntu using 
pip, then would this in anyway conflict with the graph-tool version installed 
via Ubuntu’s apt-get?

Thanks,
Gareth

On 14 Jul 2014, at 11:12, Tiago de Paula Peixoto <[email protected]> wrote:

> 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]>
> 
> _______________________________________________
> graph-tool mailing list
> [email protected]
> http://lists.skewed.de/mailman/listinfo/graph-tool

_______________________________________________
graph-tool mailing list
[email protected]
http://lists.skewed.de/mailman/listinfo/graph-tool

Reply via email to