Member Junction
    Preparing search index...

    Options controlling bounded graph traversal (GetEdges and Subgraph).

    interface GraphTraversalOptions {
        AudienceReaders?: readonly UserInfo[];
        Depth?: number;
        Direction?: "Both" | "Out" | "In";
        EdgeTypes?: string[];
        IncludeProposed?: boolean;
        MaxDepth?: number;
        MaxNodes?: number;
        MinWeight?: number;
    }
    Index

    Properties

    AudienceReaders?: readonly UserInfo[]

    Everyone besides the caller who will see the result (a run's audience). A node is admitted only when the caller AND every reader may see it, checked during traversal, so a node reachable only through a node some reader cannot see is never reached.

    Depth?: number

    Maximum hop depth (2 by default, clamped to 1..4).

    Direction?: "Both" | "Out" | "In"

    Traversal direction relative to seed/frontier nodes ('Both' by default).

    EdgeTypes?: string[]

    Optional allow-list of edge type names.

    IncludeProposed?: boolean

    When true, include 'Proposed' stored edges alongside 'Approved' ones (false by default).

    MaxDepth?: number

    Alias for Depth used by RAG/pipeline callers.

    MaxNodes?: number

    Maximum expanded nodes (50 by default, clamped to 1..200).

    MinWeight?: number

    Minimum edge weight in [0, 1].