Member Junction
    Preparing search index...

    Deterministic structural fingerprint of a TaskGraphSpec.

    interface DAGFingerprint {
        DirectEdgeBigrams: ReadonlyMap<string, number>;
        EdgeCount: number;
        ExactStructureHash: string;
        NodeCount: number;
        NodeSignaturesByTempId: ReadonlyMap<string, string>;
        OperatorMultiset: ReadonlyMap<string, number>;
        TransitiveReachabilityPairs: ReadonlySet<string>;
        WLSubtreeFeatures: ReadonlyMap<string, number>;
        WorkflowName: string;
    }
    Index

    Properties

    DirectEdgeBigrams: ReadonlyMap<string, number>

    Map from directed edge bigram (opA ->[condShape] opB) to occurrence count.

    EdgeCount: number
    ExactStructureHash: string

    Isomorphism-invariant 64-bit hex hash (16 hex chars) of the graph's WL node hashes, operator multiset, and edge bigrams. Two graphs with the same operator topology produce the exact same hash regardless of tempId naming or array ordering.

    NodeCount: number
    NodeSignaturesByTempId: ReadonlyMap<string, string>

    Per-node canonical operator signature, keyed by the node's tempId.

    OperatorMultiset: ReadonlyMap<string, number>

    Map from canonical operator signature (Kind:Target...) to occurrence count.

    TransitiveReachabilityPairs: ReadonlySet<string>

    Set of 2-hop transitive reachability pairs (opA ~> opB). Preserves structural alignment when one graph inserts an intermediate logging or validation step.

    WLSubtreeFeatures: ReadonlyMap<string, number>

    Map from Weisfeiler-Lehman subtree feature token (d0:..., d1:..., d2:...) to count.

    WorkflowName: string