Hello I have 2 questions:
1. If I have N nodes, what is the shortest way to create all possible non-isomorphic graphs? E.G for N=2 nodes, there are 2 possible graphs, N=3, there are 4, N=4 there are 11, N=5 there are 34, etc 2. Is it possible to have an array of graph objects of the form G[1],G[2]...G[10]...? Regards Prithwiraj
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
