update exercises

Author: N-Coder

docs/exercises/1 tree layout.py

@@ -17,7 +17,8 @@
 
 
 # TODO fill in the dots, possibly making changes to the surrounding code
-def postorder(n, level=0): ...
+def postorder(n, level=0):
+    ...
 
 
 postorder(root)

docs/exercises/2 topsort.py

@@ -1,7 +1,7 @@
 # %%
 # This cell generates a random graph for the topological sort to run on.
 
-# %matplotlib widget
+%matplotlib widget
 from ogdf_python import ogdf, cppinclude
 import cppyy
 
@@ -52,7 +52,8 @@ def make_graph():
 # %%
 # TODO implement the algorithm in this reusable function
 # this should work similar to the DFS example
-def topo_step(): ...
+def topo_step():
+    ...
 
 
 # %%

docs/exercises/3 dijkstra.py

@@ -43,7 +43,8 @@ def cmp(a, b):  # comparator function for two nodes a, b
 
 
 # %%
-def step(): ...
+def step():
+    ...
 
 
 # %%
@@ -55,7 +56,8 @@ def step(): ...
 b_step = ipywidgets.Button(description="Step")
 
 
-def b_step_click(*args): ...
+def b_step_click(*args):
+    ...
 
 
 b_step.on_click(b_step_click)

docs/exercises/4 contraction.py

@@ -46,11 +46,13 @@ def make_graph():
 
 
 # %%
-def contract(a, b): ...
+def contract(a, b):
+    ...
 
 
 # %%
-def check_degs(): ...
+def check_degs():
+    ...
 
 
 # %%