[igraph] Creating all possible non-isomorphic graphs from N nodes
From:
Prithwiraj MUKHERJEE
Subject:
[igraph] Creating all possible non-isomorphic graphs from N nodes
Date:
Fri, 26 Jul 2013 16:12:45 +0200
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]...?