def __init__(self, id_dds, dds, plan_reducer, max_depth=1000, max_iterations=1000000):
self.id_dds = id_dds
self.dds = dds
self.plan_reducer = plan_reducer
self.max_iterations = max_iterations
self.max_depth = max_depth
self.min_visibility = 0
Memoized.__init__(self)
GenericGraphSearch.__init__(self)
WithInternalLog.__init__(self)
def __init__(self, tree1, tree2, metric, threshold, min_visibility):
'''
:param tree1: First graph
:param tree2: Second graph
:param metric: a metric on values
:param threshold: threshold for matching
:param min_vibility: A threshold for the visibility of the joint plan.
'''
self.tree1 = tree1
self.tree2 = tree2
self.metric = metric
self.threshold = threshold
self.min_visibility = min_visibility
WithInternalLog.__init__(self)
Memoized.__init__(self)
def __init__(self, tree1, tree2, metric, threshold, min_visibility):
'''
:param tree1: First graph
:param tree2: Second graph
:param metric: a metric on values
:param threshold: threshold for matching
:param min_vibility: A threshold for the visibility of the joint plan.
'''
self.tree1 = tree1
self.tree2 = tree2
self.metric = metric
self.threshold = threshold
self.min_visibility = min_visibility
WithInternalLog.__init__(self)
Memoized.__init__(self)
