No, no docs, AFAIK, sorry, but the source looks pretty readable: https://github.com/igraph/igraph/blame/a98fccd3fb2a9f67551a09d4159ef268ee62c658/src/games.c#L2661-L2810
G. On Mon, Dec 14, 2015 at 3:47 AM, sizheng0320 <[email protected]> wrote: > > Hi, Gabor, > > is there any docs about the algorithms used by igraph_rewire_edges, please? > > I'm interested in the indexing technique used in > igraph_i_rewire_edges_no_multiple which makes the rewiring so fast. > > Thanks a lot! > > Gang Lu > > ------------------ Original ------------------ > From: "sizheng0320";<[email protected]>; > Date: Fri, Dec 11, 2015 12:28 PM > To: "igraph-help"<[email protected]>; > Subject: why is igraph_rewire_edges so fast? > > Hi everyone, > > has anyone read the code of the function igraph_rewire_edges? > > i'm doing this because i wonder why this function rewires a large network so > fast. > > it seems some indexing technique is used, because i have seen in the > function igraph_i_rewire_edges_no_multiple in games.c, some vectors such as > first, next, prev are used. > > though i tracked the code with a small network of 5 nodes and 6 edges, i > still don't understand the meaning of the three vectors. How do they work, > please? > > Thanks a lot! > > Gang Lu > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
