From 429d6d348bd000e4a8e7c079dce3a20e1bf473ac Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Tue, 16 Jun 2020 19:47:03 +0200
Subject: [PATCH] Update todo.md

---
 journal/todo.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/journal/todo.md b/journal/todo.md
index 8f3c493..87613b3 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -69,6 +69,10 @@
 * Implement a heuristic to provide a better upper bound.
     - The intermediate root constraint could be useful to do so. 
 
+* Maybe *change the cost function for the nodes*. 
+    - At the moment every node has a cost of 1. 
+    - It could work to give each node the cost of shortest path between a node and the root.
+        - With this technique we would encourage the solver to prefer nodes that are close to the root. With this we would avoid that far distant nodes would be added and connected subcomponents which are far away from the root are generated. 
 ### packaging
 * Add unit tests to the package
 * Add dependencies to the recipe
-- 
GitLab