Documentation

A universal interface bridging graph representations to a single queryable and transformable state.

GraphView pairs a GraphQuery (for snapshot traversal) with an explicitly categorized, traversable list of graph elements. It acts as a lazy transformation target: transformations operate over viewElements while algorithms use viewQuery for context lookups.

Construct via toGraphView (from a PatternGraph) or toGraphView (from a GraphLens). Finalize via materialize.

Design Principles

• viewQuery is the unmodified snapshot — it never reflects in-flight transformations, ensuring deterministic context-aware operations.
• viewElements is the mutable list — transformations update this list.
• The pairing is shallow: no deep nesting, just a list and a query record.

Defines how to handle gaps in container structures (e.g., walks) when an internal element is removed by filterGraph.

When a walk's internal relationship is filtered out, the walk becomes structurally invalid. Substitution dictates the repair strategy.

Design Rationale

There is no one-size-fits-all fallback for container gaps. Sometimes a gap means the entire container is invalid; other times a surrogate placeholder should be sutured in. An explicit parameter forces callers to reason about filtering consequences directly.