[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] problem with graph.lattice
From: |
Thierry Janssens |
Subject: |
Re: [igraph] problem with graph.lattice |
Date: |
Mon, 23 Jan 2012 12:37:02 +0100 |
thx for the answer, i tried it and it worked.
By the way, nei seems to work for the one dimensional case
g<- graph.lattice(10,1,nei=4,circular=TRUE)
>Use graph.lattice(..., circular=TRUE) to connect the first and the last
>vertex. However, you will still only get a ring. graph.lattice() has a nei=...
>parameter which should specify the number of neighbors to connect for each
>vertex, but it is not implemented yet.
>
>--
>T.
>
>On 22 Jan 2012, at 13:53, Thierry Janssens wrote:
>
>> As for as i know a 1-lattice (thus a ring-kind structure) is a ring where
>> depending on the number of k, k/2 of the neighbours are connected to each
>> vertex. But if i do graph.lattice the first and last vertex are not
>> connected are simply not connected. How does this come ?
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>>
>
>
>_______________________________________________
>igraph-help mailing list
>address@hidden
>https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>