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

[Tamas Nepusz]

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