diff --git a/journal/todo.md b/journal/todo.md
index 8f3c493e597ce377e7b94f5a4d27065987a438e8..87613b3fd93448aac7df33d03bfa27744daf2c53 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