Merge branch 'main' of gitlab.ibr.cs.tu-bs.de:alg/algorithms-lab-ss2023

sheets/01_setup_and_first_look/examples/cardinality_sat/feedback_vertex_cover/solver.py

@@ -103,8 +103,8 @@ class FeedbackVertexSetSolverSAT():
         k = len(best_solution)
         print(f"A greedy solution of size {k} was found!")
 
-        ub = k # the lowest number of vertices that are proven to build a FVS
-        lb = 0 # the lowest number of vertices that might still build a FVS (not proven wrong)
+        ub = k # the lowest number of vertices that are proven to form a FVS
+        lb = 0 # the lowest number of vertices that might still form a FVS (not proven wrong)
 
         while lb < ub:
             k = (lb + ub) // 2 # integer division (discards floating point decimals)

sheets/01_setup_and_first_look/examples/cardinality_sat/feedback_vertex_cover/util.py

@@ -41,9 +41,9 @@ def visualize_fvs(graph: nx.Graph, feedback_vertex_set: Set[Node]):
     Draws a 'before-after' visualization of a given Feedback Vertex Set solution on a given graph.
     """
     layout = nx.layout.kamada_kawai_layout(graph)
-    nx.draw_networkx(graph, pos=layout, node_color=["red" if p in feedback_vertex_set else "cyan" for p in graph.nodes()])
+    nx.draw_networkx(graph, pos=layout, node_color=["red" if p in feedback_vertex_set else "grey" for p in graph.nodes()])
     plt.show()
     _graph = graph.copy()
     _graph.remove_nodes_from(feedback_vertex_set)
-    nx.draw_networkx(_graph, pos=layout, node_color="cyan")
+    nx.draw_networkx(_graph, pos=layout, node_color="grey")
     plt.show()
\ No newline at end of file