[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] number of times a node is on the shortest path between two
|
From: |
dott. Agr. Umberto Medicamento |
|
Subject: |
Re: [igraph] number of times a node is on the shortest path between two nodes otherwise disconnected for egonetworks |
|
Date: |
Fri, 15 Nov 2013 10:43:44 +0100 |
Exactly. I’d like to get the score whatever the neighborhood/egonetwork size.
The point is that each vertex has a different score depending on the
egonetwork. I need the score of each vertex in its own ego network, keeping the
vertex ID.
U.
dott. Agr. Umberto Medicamento
PhD, MS
address@hidden
mob. +39.320.83.68.670
skype umberto7755
Il giorno Nov 14, 2013, alle ore 9:24 PM, Tamás Nepusz <address@hidden> ha
scritto:
> Hi,
>
>>> how can I get the number of times a node is on the shortest path between
>>> two nodes otherwise disconnected?
> What do you mean by saying that these two nodes are “otherwise disconnected”?
> Do you mean that you are interested in the number of times node X appears on
> a shortest path between node Y and Z if and only if node Y and Z would be
> disconnected if we removed X from the graph?
>
> —
> T.
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help