[Added a short documentation on the usage of the branch-and-bound implementation
tobias@goedderz.info**20150311115909
 Ignore-this: b408911a15fe67192cdb3dc62309908e
] hunk ./src/Utils/BranchAndBound.hs 82
+{-|
+    'bnb' is a branch-and-bound implementation that returns all minimal solutions.
+
+    The first argument '_queue_witness' is a type witness for the queue that
+    should be used and will not be evaluated.
+
+    The second argument 'nodeOps' provides the necessary operations on nodes.
+    The key is used to control the order in which nodes are searched. In which
+    order nodes with equal keys are searched depends on the queue. The value is
+    used to prune the search. Only solutions with minimum value are returned.
+
+    The third argument 'x' is the root node.
+ -}
hunk ./src/Utils/BranchAndBound.hs 153
-    {- Steps:
-       - Compare the lower bound of x against the global upper bound (i.e. the
-         best solution so far). If it's greater, prune (i.e., return []).
-       - Insert all children of x it into the priority queue.
-       - If x is a leaf, update the global upper bound and return [x].
-    -}