[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] random generator graph in C

From: Gábor Csárdi
Subject: Re: [igraph] random generator graph in C
Date: Tue, 3 Nov 2009 16:06:44 +0100

On Tue, Nov 3, 2009 at 4:00 PM, wassim gmail <address@hidden> wrote:
> Gábor Csárdi a écrit :
>> It would probably work it you could give an example, with a small graph.
> What i want to do is to have something like this
>        generate_random (graph);
>      while i in graph do
>            extract neighbor(i)
>            while j in neighbor(i) do
>                  compute_adress(j)
>            endwhile
>      endwhile
> This is what i want to do with igrph. I don't know if it is possible or not.

Should be. igraph_neighbors() gives you the neighbors of a vertex.
Vertex ids are just numbers between zero and the number of vertices
minus one.

>> The points are generated on the unit square, so their distance is
>> sqrt(2) at most. If you give '30' as the radius, then all pairs of
>> vertices will be connected, resulting a full graph, 19531*19530/2
>> edges. This requires about three Gb of memory. Are you sure you want a
>> geometric random graph?
> Ah i didn't know that they are in randomly generated in unit square. Of
> course i don't want that as here as i do all node will be connected.
> How can i avoid this ? How can i generate random graph like a network
> topology ? I want that node have random and different degree so in this way
> i can obtain a random network.

Probably the erdos_renyi_game() function is what you are looking for.


> Thanks a lot for your help
> Best regards,

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

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