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

[Martin Tomko]

Thanks Tamas,
that's a good suggestion, will try that.
Cheers
Martin

On 8/6/2010 8:00 PM, Tamas Nepusz wrote:
> 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
>
>
>
>    


--
Martin Tomko
Postdoctoral Research Assistant

Geographic Information Systems Division
Department of Geography
University of Zurich - Irchel
Winterthurerstr. 190
CH-8057 Zurich, Switzerland

email:  address@hidden
site:   http://www.geo.uzh.ch/~mtomko
mob:    +41-788 629 558
tel:    +41-44-6355256
fax:    +41-44-6356848