From 29cfcdcfcbe1f3add917b30c5f4680789ed20610 Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Fri, 10 Jul 2020 02:51:01 +0200
Subject: [PATCH] Update todo.md

---
 journal/todo.md | 30 +++++++++++++-----------------
 1 file changed, 13 insertions(+), 17 deletions(-)

diff --git a/journal/todo.md b/journal/todo.md
index 1b2dbcf..3404299 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -124,25 +124,21 @@
 # Week 8
 ## thesis
 * Mix the stuff from the methods section and the definitions up a bit. 
-* Add missing stuff. (Highest priority! Rather have awfull stuff that can be refinded than having the feeling of getting stucked!)
-	- Different type of constraints to enforce connectivity. 
-	- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints. 
-	- Introduction
-	- Table of results
-	- Discussion
-	- Implementation
+* Add missing stuff. (Highest priority! Rather have awfull stuff that can be refinded than having the feeling of getting stucked!) ✔
+	- Different type of constraints to enforce connectivity. ✔
+	- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints. ✔
+	- Introduction ❌
+	- Table of results ❌
+	- Discussion ❌
+	- Implementation ❌
 
 ## python 
 ### runtime 
-* Check how large is the difference between the size of a minimum dominanting set and a rooted connected minimum dominating set for all test instances.
-	- GNM 250 graphs.
-	- GNM 100 graphs. 
-
-
-## python
-### runtime 
-* For the leaf instances, the grid graphs and some of the random graphs: 
-	- measure the size of a minimal unconnected solution and how fast the added separators close the gap.
+* Check how large is the difference between the size of a minimum dominanting set and a rooted connected minimum dominating set for all test instances.✔
+	- GNM 250 graphs.✔
+	- GNM 100 graphs. ✔
+* For the leaf instances, the grid graphs and some of the random graphs: ✔
+	- measure the size of a minimal unconnected solution and how fast the added separators close the gap. ✔ 
 
 # Backlog
 ## Python 
@@ -167,4 +163,4 @@
 ### packaging
 * Add unit tests to the package
 * Add dependencies to the recipe
-* Find a place to store the code if the package will be published(Maybe a standard github repo)
+* Find a place to store the code if the package will be published(Maybe a standard github repo)
\ No newline at end of file
-- 
GitLab