|
From: | EthanK Gough |
Subject: | [igraph] Clique Percolation Algorithm |
Date: | Thu, 5 Dec 2013 11:07:11 -0800 |
Hi Gaborthanks
I have another quick question. So if the edge weights are added when calculating the lengths of paths, does that mean then that a path with larger edge weights is longer than one with smaller edge weights?
EthanOn Mon, Nov 25, 2013 at 12:25 PM, Gábor Csárdi <address@hidden> wrote:
It does exactly that.On Mon, Nov 25, 2013 at 3:12 PM, EthanK Gough <address@hidden> wrote:
> How does igraph handle edge weights when using edge.betweenness and
> shortest.paths? Does it simply add the edge weights when calculating the
> lengths of paths and finding geodesics?
Gabor
> Thanks
>
> Ethan
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
[Prev in Thread] | Current Thread | [Next in Thread] |