Re: [igraph] Problems calculating shortest paths for sparse large graph

[Charles Novaes de Santana]

Wow, thank you for your very quick answer, Tamás!

On Wed, Nov 21, 2012 at 12:10 PM, Tamás Nepusz <address@hidden> wrote:
>> 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).

Yes... you are right, sorry! I used weights=NA, but I wrote it wrong
in the mail. Thanks ;)

> Also, do you happen to have any pathological weights in your graph (like 
> negative weights or zeros)?

No, each of the weights have positive values. Actually I am forcing my
graph to have all the weights equal 1, in order to compare it with the
original graph with different, but positive, weights.

Best,

Charles


>
> --
> T.
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help



-- 
Um axé! :)

--
Charles Novaes de Santana
http://www.imedea.uib-csic.es/~charles
PhD student - Global Change
Laboratorio Internacional de Cambio Global
Department of Global Change Research
Instituto Mediterráneo de Estudios Avanzados(CSIC/UIB)
Calle Miquel Marques 21, 07190
Esporles - Islas Baleares - España

Office phone - +34 971 610 896
Cell phone - +34 660 207 940