Commit 429d6d34 authored by Mario Surlemont's avatar Mario Surlemont
Browse files


parent 934ef154
......@@ -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
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment