[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Correlating nodes with high betweenness
From: |
Arun |
Subject: |
Re: [igraph] Correlating nodes with high betweenness |
Date: |
Mon, 7 Dec 2009 17:53:59 -0600 |
betweenness_list = g.betweenness()
your_answer = []
for e in g.es:
v1 = e.tuple[0]
v2 = e.tuple[1]
if betweenness_list[v1] > threshold and betweenness_list[v2] > threshold:
your_answer.append(e)
On Mon, Dec 7, 2009 at 10:29 AM, anupam sinha <address@hidden> wrote:
>
> Hi all,
> I have a network of the following format :
>
> eco:b4069 eco:b4069
> eco:b4069 eco:b1241
> eco:b4069 eco:b0115
> eco:b4069 eco:b3256
> eco:b4069 eco:b0185
> eco:b4069 eco:b2316
>
> where each of the alphanumeric value is a node id. I calculate the
> betweenness of the nodes. My query though is how do I find pairs of nodes
> which are connected to each other and have betweenness values above a
> certain threshold ?
> Thanks in advance.
>
>
> Regards,
>
>
> Anupam
>
>
>
>
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>