.

allgraphs.py

@@ -51,6 +51,10 @@ def genGraphs(N):
 
         # induction: the graph remains connected if previous (N-1) graph is
         # connected, and n is connected to at least one node in the previous graph.
+        #
+        # FIXME wrong: (N-1) graph might be not connected and if n is adding
+        # connection to enough nodes N-graph might become connected. Below
+        # approach thus skips some possible connected graphs.
         Sedges = set()
 
         # for all combinations to which nodes n is connected in the previous graph.