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

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

diff --git a/journal/todo.md b/journal/todo.md
index 87613b3..a9c5966 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -73,6 +73,8 @@
     - 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. 
+        - At least this could lead to a heuristic. 
+
 ### packaging
 * Add unit tests to the package
 * Add dependencies to the recipe
-- 
GitLab