terminal in the case where search is continued after finding a goal.
2.0.0
bidirectional search capabilities.
1.2.0
Python list.
1.1.0
nodes to have node_cost instead of path_cost. Updated optimization algs to use node.cost() instead of problem.node_value(node), except for branch and bound, which uses node_value as an optimistic estimate of all nodes reachable from the node.