[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## [igraph] average shortest path between same sets of nodes

**From**: |
Simone Gabbriellini |

**Subject**: |
[igraph] average shortest path between same sets of nodes |

**Date**: |
Thu, 20 Jan 2011 17:04:07 +0100 |

Hello again,
After retrieving the largest connected component (lcc) of a bipartite
graph, I would like to find the average shortest paths for top and
bottom nodes. Is there something like this in the python interface:
mean(shortest.paths(lcc, v=V(lcc)[type==FALSE],
to=V(lcc)[type==FALSE], mode = 'all'))
mean(shortest.paths(lcc, v=V(lcc)[type==TRUE], to=V(lcc)[type==TRUE],
mode = 'all'))
best,
simone

**[igraph] average shortest path between same sets of nodes**,
*Simone Gabbriellini* **<=**