DependencyGraph.evaluation_order()

Return nodes in dependency-first order (leaves before formulas that use them).

Usage

Source

DependencyGraph.evaluation_order(
    *,
    strict=True,
    iterate_enabled=None,
)

Edge direction is A -> B meaning A depends on B. This method returns an ordering suitable for sequential evaluation (dependencies first).

If iterate_enabled is True (workbook has iterative calculation on), any must-cycle or may-cycle is rejected: generated Python does not emulate Excel’s iterative convergence. Pass False or None to apply the usual strict / non-strict rules without this check.