Btw. you can also try to remove multiple and loop edges if you have any. Just a guess, maybe they are not a problem, but it's worth trying, just call simplify() on the graph.
G. On Mon, Nov 18, 2013 at 10:27 AM, Tony Larson <[email protected]> wrote: > Will try and work up a toy example later this afternoon, as the graph I am > working on is too large to post (generated from a 4000 x 4000 adjacency > matrix). > > Thanks > Tony > > On 18 Nov 2013 15:06, "Gábor Csárdi" <[email protected]> wrote: >> >> Hi! >> >> On Mon, Nov 18, 2013 at 10:00 AM, Tony Larson <[email protected]> >> wrote: >> > Hi, >> > I am using igraph 0.6.2 on R. >> >> That is 0.6-2, right? Note that there is a newer version. I can't >> recall any changes in maximal cliques, though, so it won't fix your >> issue, probably, but it fixes other issues. >> >> > When I use maximal.cliques() to get a list of >> > complete subgraphs back, several have partly duplicated values, e.g >> > >> > [1] 1 2 3 4 5 >> > [2] 1 2 3 4 5 7 8 >> > [3] 1 2 3 4 5 6 >> > >> > If all vertices in each listing are completely connected, then why in >> > the >> > example above don't I get single list entry for indices 1:8? >> >> If you do, then this is a bug. Can you please show us an example that >> reproduces it? Thanks. >> >> Gabor >> >> > Why do I get >> > 3? How can I merge these into one list item? >> > >> > Thanks >> > Tony >> > >> > >> > _______________________________________________ >> > 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 > > > _______________________________________________ > 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
