greedy_search

TangleSweep.greedy_search(max_width: int, explore_agreement_lower_bound: int = 1, max_depth: int | None = None, start_node: Tangle | None = None)

Greedily search for tangles.

What this means is that the search goes through all of the levels in the tree, optionally starting from a different node than the root node. And, if there are as of yet not extended nodes, it extends at most the specified number of nodes which have the highest agreement values of those that are not yet extended.

Parameters

max_widthint

The maximum number of tangles to extend each level.

explore_agreement_lower_boundint

Only extend tangles which have at least this agreement value.

max_depthint, optional

The maximum depth to extend to. The depth is specified relatively to the root.

start_nodeTangle, optional

Can be used to set a different starting node than the root node.