.

8b7093d0 · Kirill Smelkov · 4fa0b3f6 · 8b7093d0
Commit 8b7093d0 authored Feb 15, 2022 by Kirill Smelkov
Hide whitespace changes
Inline Side-by-side

Showing with 4 additions and 0 deletions

allgraphs.py allgraphs.py +4 -0

No files found.
--- a/allgraphs.py
+++ b/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.