[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Problems calculating shortest paths for sparse large graph
From: |
Tamás Nepusz |
Subject: |
Re: [igraph] Problems calculating shortest paths for sparse large graph |
Date: |
Wed, 21 Nov 2012 12:10:02 +0100 |
> I also tried to ignore the weights, by using the option
> "weights=E(net)$NA", but it didn't work.
You should use weights=NA if you want to ignore the weights (as far as I know).
Also, do you happen to have any pathological weights in your graph (like
negative weights or zeros)?
--
T.