This page describes the available merge trees that can be used to precompute a merge strategy, either for the entire task or a given subset of transition systems of a given factored transition system. Merge trees are typically used in the merge strategy of type 'precomputed', but they can also be used as fallback merge strategies in 'combined' merge strategies.

Linear merge trees

These merge trees implement several linear merge orders, which are described in the paper:

linear(random_seed=-1, update_option=use_random, variable_order=CG_GOAL_LEVEL)

FastDownward: Doc/MergeTree (last edited 2016-08-23 13:07:33 by XmlRpcBot)