.. _method-multifidelity_sampling-search_model_graphs-full_recursion: """""""""""""" full_recursion """""""""""""" Perform a full recursion of all admissible DAGs for a given model ensemble **Specification** - *Alias:* None - *Arguments:* None - *JSON argument key:* None - *Default:* true **Description** A full recursion includes admissible directed acyclic graphs (DAGs) up to maximum depth and is equivalent to a ``partial_recursion`` with a ``depth_limit`` equal to the number of approximation models. **Examples** .. tab:: Freeform .. code-block:: dakota method, model_pointer = 'ENSEMBLE' approximate_control_variate acv_mf pilot_samples = 25 seed = 8674132 search_model_graphs full_recursion max_function_evaluations = 500 .. tab:: JSON .. code-block:: json { "method": [ { "approximate_control_variate": { "model_pointer": "ENSEMBLE", "pilot_samples": [25], "seed_sequence": [8674132], "search_model_graphs": { "full_recursion": {} }, "max_function_evaluations": 500 } } ] } **Theory** Refer to :cite:p:`Bomarito2022` for additional details on generalized ACV recursion.