[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
RE: [igraph] weighted centralities
From: |
Harun Pirim |
Subject: |
RE: [igraph] weighted centralities |
Date: |
Fri, 21 May 2010 16:11:55 -0500 |
Hi All,
I want to find the most negative (weighted) cycle in a graph. Can I do that
using igraph package in R.
Thanks,
Harun Pirim
-----Original Message-----
From: address@hidden
[mailto:address@hidden On Behalf Of
Gábor Csárdi
Sent: Friday, May 21, 2010 9:21 AM
To: Help for igraph users
Subject: Re: [igraph] weighted centralities
Please save me some time and hand calculation and tell me what would
be the correct result for the weighted graph. Thanks,
Gabor
On Fri, May 21, 2010 at 4:06 PM, hamaina rachid <address@hidden> wrote:
> Thank you Gabor. This is a part of my calculation. this example is from a
pajek file, but the same happen with a "ncol" format.
>
>> G<-read.graph("graphtest.net", format="pajek")
>> G
> Vertices: 7
> Edges: 6
> Directed: FALSE
> Edges:
> [0] 0 -- 1
> [1] 0 -- 2
> [2] 0 -- 3
> [3] 4 -- 5
> [4] 4 -- 6
> [5] 0 -- 4
>> E(G)$weight
> [1] 10 15 95 32 5 25
>> betweenness(G)
> [1] 12 0 0 0 9 0 0
>> betweenness(G, weights=NA)
> [1] 12 0 0 0 9 0 0
>
>
>
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> UNIL DGM
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help