[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] peeling off graphs - minimum spanning tree traversal

**From**: |
Tamas Nepusz |

**Subject**: |
Re: [igraph] peeling off graphs - minimum spanning tree traversal |

**Date**: |
Fri, 6 Aug 2010 20:00:42 +0200 |

Hi Martin,
>* I need to get numbers of vertices in a specific radius from a given node, *
>* basically "peeling" the shells of the minimum spanning tree.*
Probably you are much better off with shortest.paths(g, node), this will give
the length of the shortest paths leading from node to all the other vertices.
After that, you can simply count how many nodes are there that have distance k
from your selected root node.
Cheers,
Tamas

**[igraph] peeling off graphs - minimum spanning tree traversal**, *Martin Tomko*, `2010/08/06`
**Re: [igraph] peeling off graphs - minimum spanning tree traversal**,
*Tamas Nepusz* **<=**
**[igraph] getting the graph of the maximum component**, *Martin Tomko*, `2010/08/08`
**Re: [igraph] getting the graph of the maximum component**, *Claudia Muller-Birn*, `2010/08/08`
**Re: [igraph] getting the graph of the maximum component**, *Gábor Csárdi*, `2010/08/08`
**Re: [igraph] getting the graph of the maximum component**, *Martin Tomko*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Gábor Csárdi*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Martin Tomko*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Gábor Csárdi*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Martin Tomko*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Gábor Csárdi*, `2010/08/09`
**Re: [igraph] getting the graph of the maximum component**, *Martin Tomko*, `2010/08/09`