[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: Martin Tomko
Subject: Re: [igraph] peeling off graphs - minimum spanning tree traversal
Date: Sat, 07 Aug 2010 14:56:34 +0200
User-agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv: Gecko/20100227 Lightning/1.0b1 Thunderbird/3.0.3

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

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.


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

reply via email to

[Prev in Thread] Current Thread [Next in Thread]