Remove spurious commented code

Author: brad-lackey

source/pip/qsharp/qre/application/magnets/geometry/complete.py

@@ -148,40 +148,3 @@ def edge_coloring(self) -> HypergraphEdgeColoring:
                 i, j = edge.vertices
                 coloring.add_edge(edge, (i + j - m) % n)
         return coloring
-
-    # Color edges based on the second vertex index to create n parallel partitions
-    # for i in range(m):
-    #    for j in range(m, m + n):
-    #        self.color[(i, j)] = (
-    #            i + j - m
-    #        ) % n  # Color edges based on second vertex index
-
-    # Edge coloring for parallel updates
-    # The even case: n-1 colors are needed
-    # if n % 2 == 0:
-    #    m = n - 1
-    #    for i in range(m):
-    #        self.color[(i, n - 1)] = (
-    #            i  # Connect vertex n-1 to all others with unique colors
-    #        )
-    #        for j in range(1, (m - 1) // 2 + 1):
-    #            a = (i + j) % m
-    #            b = (i - j) % m
-    #            if a < b:
-    #                self.color[(a, b)] = i
-    #            else:
-    #                self.color[(b, a)] = i
-
-    # The odd case: n colors are needed
-    # This is the round-robin tournament scheduling algorithm for odd n
-    # Set m = n for ease of reading
-    # else:
-    #    m = n
-    #    for i in range(m):
-    #        for j in range(1, (m - 1) // 2 + 1):
-    #            a = (i + j) % m
-    #            b = (i - j) % m
-    #            if a < b:
-    #                self.color[(a, b)] = i
-    #            else:
-    #                self.color[(b, a)] = i