Then one solution is to get the unweighted minimum cuts between a vertex s and t. Then for each minimum cut that consists of a single vertex, you check how many times this vertex appears in the shortest paths between s and t.
The minimum cuts can be calculated with stMincuts() (in R) and all shortest paths can be queried with get.all.shortest.paths(). Gabor On Thu, Nov 14, 2013 at 3:24 PM, Tamás Nepusz <[email protected]> wrote: > 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 > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
