Re: [igraph] Cayley Tree

[Tamas Nepusz]

If I understand it right, a k-Cayley tree is simply a tree where each
non-leaf vertex has degree k. The standard tree generation routine in
igraph therefore builds a Cayley tree if the number of nodes is set
appropriately. (See igraph_tree in C, graph.tree in R, Graph.Tree in
Python).

-- 
Tamas

On Wed, Nov 18, 2009 at 12:29:59AM +0100, Marco wrote:
> Hi all,
> 
> any ideas on how to implement efficiently a routine to build a Cayley tree?
> 
> Thanks in advance,
> 
> marco
> 
> --
> restituiremo il riso ai salici
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help