Re: [igraph] Calculating weighted betweeness ? Missing something in documentation ?

[address@hidden]

Hi, 

I am using igraph 0.6. Now I see why it shows the same numbers in cases with and without weight. There is only one possible path between two nodes, so with and without weights it does not matter. Can you tell me how does shortest path algorithm makes a decision when which route to take when weights are included ? Any references to literature ?

Thanks

On 21 May 2012 16:03, Gábor Csárdi <address@hidden> wrote:

Well, maybe you are doing something wrong. We can only tell if you
show us what you are doing. Also make sure that you are using the 0.6
version, e.g. by typing

library(help=igraph)

in R.

Gabor

> I am looking for a centrality measure which can be used for network with
> disconnected components taking into account both weights and distances
> (shortest paths). I think the mentioned paper is what I want, but its not
> implemented in igraph.
>
> Do you know how to use igraph graph object with the betweenness_w function
> from tnet package ? That would be helpful, I can't get it working.
>
> Thanks
>
>
> On 21 May 2012 15:29, Gábor Csárdi <address@hidden> wrote:
>>
>> weighted shortest paths are used instead of unweighted shortest paths.
>>
>> Gabor
>
>

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



--
Gabor Csardi <address@hidden>     MTA KFKI RMKI

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