|
From: | Qunawei Zhang |
Subject: | Re: [igraph] question about "degree.sequence.game()" |
Date: | Mon, 09 Sep 2013 09:30:09 -0400 |
User-agent: | Microsoft-MacOutlook/14.3.6.130613 |
Dear Gabor: Thanks for your explain. But what I want to know is the strategies you used in the method with "simple.no.multiple". Would you please briefly describe the basic ideas of the method and how did you do to avoid the multiple and loop edges? Thanks. Have a good day! Best Quanwei From: Gábor Csárdi <address@hidden> Reply-To: Help for igraph users <address@hidden> Date: Saturday, September 7, 2013 8:31 AM To: Help for igraph users <address@hidden> Subject: Re: [igraph] question about "degree.sequence.game()" Hi,
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
On Fri, Sep 6, 2013 at 11:33 PM, Qunawei Zhang <address@hidden> wrote:
degree.sequence.game(rep(2, 10), method="simple.no.multiple")
Right. Use the "vl" method if you want a connected graph. Gabor
|
[Prev in Thread] | Current Thread | [Next in Thread] |