Function appendDependencies

appendDependencies(
    md: MarkdownBuilder,
    target: DependencySource,
    options?: AppendDependencyOptions,
    context?: DependencyContext,
): Promise<void>
Appends the Precedents and Dependents sections for anything that exposes the calculation graph — a cell, a range or a name, which answer the same questions with the same shape.
Parameters
- md: MarkdownBuilder
- target: DependencySource
- Optionaloptions: AppendDependencyOptions
- Optionalcontext: DependencyContext
Returns Promise<void>

Remarks
The heading carries the reach; the tree beneath shows the path. The flat reach (getPrecedents() / getDependents()) is what the engine already holds for recalculation, so its size costs one call: (239 cells · 216 inputs · depth 6 · 9 areas). That is the answer to the common question — how much does this read, how much reads it — without any code. The tree is the explanation, and it is budgeted by rows (see AppendDependencyOptions.maxTreeRows).

inputs are the typed (non-formula) cells in the precedent reach — the values a change to the model is actually made in. outputs are the dependents nothing else reads — the reported figures a change here ends up in, which is why they are listed by address and row label.

depth is the longest chain of hops, which is the number of levels the full tree would have. It is the one measure the engine does not hold, so it is a walk, bounded, and stated as a lower bound (depth ≥ n) when the bound fires.