Initialize self. See help(type(self)) for accurate signature.

Remove previously propagated copies of tags from every reachable downstream entity.

Inverse of propagate_tags -- traverses the same graph with the same per-edge origin attribution and deletes the matching tag entries. See propagate_tags for why this cannot be expressed on top of get_next_entities_recursive.

Wrap the current entities as a depth-0 NavigableEntitySet.

Return the wrapped entities as a set.

Return the wrapped entities as a list. Order is not guaranteed (the underlying storage is a set).

Return an arbitrary entity from the set, or None if empty.

Useful when the caller knows the navigator wraps a single entity.

Return the direct downstream neighbors of the wrapped entities.

Only one hop is followed (no recursion). Entities of any type listed in requested_entities are merged into a single NavigableEntitySet.

Return every entity transitively reachable downstream.

Traverses the lineage graph breadth-first. Each entity is visited once, annotated with its depth in the returned NavigableEntitySet. Use this for impact analysis ("what entities would be affected"). Edge-level provenance is not preserved -- if you need to know which immediate upstream caused a given downstream to be reached, use propagate_tags instead.

Return the direct downstream notes. Empty by default; overridden by subclasses whose entity type has a notes-edge in the lineage graph.

Return the direct downstream resources. Empty by default; overridden by subclasses.

Return the direct downstream scenarios. Empty by default; overridden by subclasses.

Return the direct downstream views. Empty by default; overridden by subclasses.

Return every entity transitively reachable upstream.

Mirror of get_next_entities_recursive but walks the lineage graph in the opposite direction (towards ancestors).

Return the direct upstream notes. Empty by default; overridden by subclasses.

Return the resources backing the views embedded in the wrapped notes.

Return the scenarios that produced the resources of the views in the wrapped notes.

Return the views embedded in the wrapped notes via NoteViewModel.

Return True if at least one entity is wrapped.

Return True if any direct downstream neighbor exists.

Return True if no entities are wrapped.

Propagate the given tags to every transitively reachable downstream entity.

Each propagated tag carries an origin (TagOrigin) describing the immediate upstream entity that caused it -- this is why we cannot reuse get_next_entities_recursive here: that method flattens the graph and discards edge information, while propagation needs per-edge attribution. The origin's type and id depend on the edge kind: scenario->resource yields SCENARIO_PROPAGATED, resource->next-resource yields TASK_PROPAGATED, resource->view yields RESOURCE_PROPAGATED, view->note yields VIEW_PROPAGATED.

Performance: get_next_*() queries are hoisted out of the per-entity loop, and visited tracks entities whose downstream has already been walked so reconverging paths in the DAG don't re-walk subgraphs.

Build the appropriate concrete navigator for a single entity, by type and id.

Raises if the entity does not exist or if entity_type is unknown.