diff --git a/journal/todo.md b/journal/todo.md
index c6aeda3be80f59cef92c50b3973b6baaa8804ed5..ebb0bb7497f46a8f90687693e248d4ac56cceb08 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -2,11 +2,12 @@
 ## Python
 ### implementation
 * Refactor code. 
-	- Fix bug with separators.
+	- Fix bug with separators. ✔
 	- Add option to cli to select which type of inequalities to be included. 
 * Implement different type of constraints. 
 	- _Solving the Maximum-Weight Connected Subgraph Problem to Optimality_
-	- _Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+	- _Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming_ ✔
+	    - Only one type of constraints  which performed best in this paper. Performs bad on our graphs. 
 
 ### runtime
 * Do tests according to test concept and store data in some sort of strucured format(CSV/ XML/ JSON) which could be included in python or R.