nodes

class brainstate.graph.nodes(node, *filters, allowed_hierarchy=(0, 2147483647))

Collect graph nodes as ``FlattedDict``(s), optionally filtered.

Parameters:

• node (Any) – The graph node.

• *filters (type | str | Callable[[Tuple[Key, ...], Any], bool] | bool | EllipsisType | None | Tuple[Filter, ...] | List[Filter]) – Optional predicates/types to partition the collected nodes.

• allowed_hierarchy (tuple[int, int]) – (lo, hi) graph-node depth bounds.

Returns:

All nodes (single filter or none), or one mapping per filter.

Return type:

FlattedDict | Tuple[FlattedDict, ...]