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