Merge pull request #128 from GraphFilter/126-bug-export-graph6

atilaajones · web-flow · commit 6ffdf3d3aa73 · 2022-01-27T18:12:48.000-03:00
126 bug export graph6
diff --git a/source/controller/controller.py b/source/controller/controller.py
@@ -157,7 +157,7 @@ def export_to_g6(self):
             self.show_loading_window(len(project_information_store.filtered_graphs))
             file = open(file_name, 'w')
             for step, graph in enumerate(project_information_store.filtered_graphs):
-                file.write(graph)
+                file.write(f'{graph}\n')
                 self.update_loading_window(step)
             file.close()
             self.loading_window.close()
diff --git a/source/store/operations_and_invariants/invariants.py b/source/store/operations_and_invariants/invariants.py
@@ -104,7 +104,6 @@ def max_line_of_string(text: str):
         list_text = str(text).split("\n")
         return len(max(list_text, key=len))
 
-
     @staticmethod
     def MainEigenvalue(matrix: np.ndarray):
         eigenvalues, vectors = la.eigh(matrix)
@@ -114,9 +113,3 @@ def MainEigenvalue(matrix: np.ndarray):
             if UtilsToInvariants.approx_to_int(np.dot(one, vectors[:, i])) != 0:
                 mains.add(value)
         return mains
-
-
-
-
-
-
diff --git a/source/store/operations_and_invariants/num_invariants.py b/source/store/operations_and_invariants/num_invariants.py
@@ -587,12 +587,11 @@ def calculate(graph):
     @staticmethod
     def print(graph, precision):
         if nx.number_of_isolates(graph) < 1:
-            return Utils.print_set(nx.algorithms.covering.min_edge_cover(graph),precision)
+            return Utils.print_set(nx.algorithms.covering.min_edge_cover(graph), precision)
         else:
             return "Graph has isolate vertice."
 
 
-
 class NumberOfTriangles(InvariantNum):
     name = "Number of triangles"
     code = '\u03A4'
diff --git a/source/store/operations_and_invariants/other_invariants.py b/source/store/operations_and_invariants/other_invariants.py
@@ -262,7 +262,6 @@ def print(graph, precision):
         return Utils.print_eigenvectors_and_eigenvalues(NormalizedLaplacianEigenvectors.calculate(graph), precision)
 
 
-
 class MaximumClique(InvariantOther):
     name = "Maximum Clique"
     type = 'set'
