@graphty/graph-format 0.0.0 → 0.2.0

package/dist/src/populate/from-records.js

@@ -0,0 +1,447 @@
+/**
+ * `fromRecords()` (design section 8.1, entry point 3): plain node-link records, the shape every JSON
+ * dialect parses into and what graphty-element's data sources emit. Every record is pushed into a
+ * GraphBuilder scalar by scalar -- the id, the endpoints and the weight through `addNode` / `addEdge`,
+ * every other key through `setNodeValue` / `setEdgeValue` -- so attribute columns are inferred and
+ * widened per column by the builder exactly as `addNodeRecord` / `addEdgeRecord` would (design
+ * section 5.1), and the FreezeReport carries the widenings. The reserved keys (the node id, the edge
+ * source / target and the weight) never become attribute columns: the id map and the arc array
+ * already hold them.
+ *
+ * Id coercion (design section 4.1) is applied here, before an id reaches the builder: "keep" (the
+ * default; JSON values are already typed), "canonical" (canonical integer text becomes a number,
+ * everything else stays a string), "string" and "number".
+ */
+import { GraphBuilder } from "../builder/graph-builder.js";
+import { GraphFormatError } from "../errors.js";
+import { assertOneOf } from "../util/options.js";
+import { splitOptions } from "./from-edge-arrays.js";
+/** The default source keys, tried in order when `edgeSource` is not given. */
+const SOURCE_KEYS = ["source", "src", "from"];
+/** The default target keys, tried in order when `edgeTarget` is not given. */
+const TARGET_KEYS = ["target", "dst", "to"];
+/** The canonical integer text of design section 4.1. */
+const CANONICAL_INTEGER = /^-?(0|[1-9][0-9]*)$/;
+// ============================================================ ids
+/**
+ * Whether a record has an own property (records may come from `JSON.parse`, so prototype lookups are
+ * never consulted).
+ * @param record - the record
+ * @param key - the key
+ * @returns true when the key is an own property
+ */
+function hasKey(record, key) {
+    return Object.prototype.hasOwnProperty.call(record, key);
+}
+/**
+ * The E_INVALID_ID error for an id cell the coercion rule cannot turn into a NodeId.
+ * @param field - which cell (id / source / target)
+ * @param value - the value
+ * @param rule - the coercion rule in force
+ * @returns the error
+ */
+function invalidId(field, value, rule) {
+    return new GraphFormatError("E_INVALID_ID", `${field} value of type ${typeof value} is not a legal id under "${rule}"`, {
+        field,
+        found: typeof value,
+        rule,
+    });
+}
+/**
+ * Apply an id coercion rule to one id cell (design section 4.1). The result still goes through the
+ * builder's own id validation (E_INVALID_ID for anything that is not a finite number or a well-formed
+ * string), so this function only converts; it rejects the shapes a rule cannot convert.
+ * @param value - the cell value
+ * @param rule - the coercion rule
+ * @param field - which cell, for the error message
+ * @returns the id to hand to the builder
+ */
+export function coerceId(value, rule, field) {
+    switch (rule) {
+        case "keep":
+            if (typeof value === "string" || typeof value === "number") {
+                return value;
+            }
+            throw invalidId(field, value, rule);
+        case "canonical":
+            if (typeof value === "number") {
+                return value;
+            }
+            if (typeof value === "string") {
+                // "-0" is excluded so the rule stays injective on text (-0 and 0 are one id)
+                if (CANONICAL_INTEGER.test(value) && value !== "-0") {
+                    const n = Number(value);
+                    return Number.isSafeInteger(n) ? n : value;
+                }
+                return value;
+            }
+            throw invalidId(field, value, rule);
+        case "string":
+            if (typeof value === "string") {
+                return value;
+            }
+            if (typeof value === "number" ||
+                typeof value === "boolean" ||
+                typeof value === "bigint" ||
+                value === null) {
+                return String(value);
+            }
+            throw invalidId(field, value, rule);
+        case "number":
+            if (typeof value === "number") {
+                return value;
+            }
+            if (typeof value === "string") {
+                return Number(value);
+            }
+            throw invalidId(field, value, rule);
+        default: {
+            const name = rule;
+            throw new GraphFormatError("E_UNSUPPORTED", `unknown id coercion "${name}"`, {
+                field: "ids",
+                found: name,
+                reason: "unsupported option",
+            });
+        }
+    }
+}
+/**
+ * Read an endpoint cell: the explicit key when one was given, else the first of the default keys the
+ * record has.
+ * @param record - the edge record
+ * @param explicit - the caller's key, or undefined
+ * @param defaults - the default keys in order
+ * @returns the key that was used and its value; the key is null when none is present
+ */
+function endpointOf(record, explicit, defaults) {
+    if (explicit !== undefined) {
+        return { key: hasKey(record, explicit) ? explicit : null, value: record[explicit] };
+    }
+    for (const key of defaults) {
+        if (hasKey(record, key)) {
+            return { key, value: record[key] };
+        }
+    }
+    return { key: null, value: undefined };
+}
+/**
+ * The E_INVALID_ID error for an edge record without an endpoint.
+ * @param field - "source" or "target"
+ * @param keys - the keys that were tried
+ * @param edge - the record's position in the edge iteration
+ * @returns the error
+ */
+function missingEndpoint(field, keys, edge) {
+    return new GraphFormatError("E_INVALID_ID", `edge record ${edge} has no ${field} (keys tried: ${keys.join(", ")})`, {
+        field,
+        keys: [...keys],
+        edge,
+        reason: "missing endpoint",
+    });
+}
+// ============================================================ attribute policy
+/**
+ * How non-reserved record keys become columns: the builder's inference, one json column per key, no
+ * columns at all, or only the declared columns.
+ */
+class AttributePolicy {
+    /**
+     * Resolve the `columns` option.
+     * @param columns - the option value; default "infer"
+     */
+    constructor(columns) {
+        this.handles = { node: new Map(), edge: new Map() };
+        if (columns === undefined || columns === "infer") {
+            this.mode = "infer";
+            this.declared = new Map();
+            return;
+        }
+        if (columns === "json" || columns === "none") {
+            this.mode = columns;
+            this.declared = new Map();
+            return;
+        }
+        if (typeof columns === "string") {
+            // unreachable for typed callers; an unknown mode string from untyped JS lands here
+            const found = columns;
+            throw new GraphFormatError("E_UNSUPPORTED", `unsupported columns option "${found}"`, {
+                field: "columns",
+                found,
+                reason: "unsupported option",
+            });
+        }
+        const declared = new Map();
+        const list = columns;
+        for (const decl of list) {
+            if (typeof decl.name !== "string" || decl.name.length === 0) {
+                throw new GraphFormatError("E_COLUMN_TYPE", "a column declaration needs a non-empty name", {
+                    field: "name",
+                    found: decl.name,
+                });
+            }
+            if (declared.has(decl.name)) {
+                throw new GraphFormatError("E_COLUMN_EXISTS", `column "${decl.name}" is declared twice`, {
+                    column: decl.name,
+                });
+            }
+            declared.set(decl.name, decl);
+        }
+        this.mode = "declared";
+        this.declared = declared;
+    }
+    /**
+     * Whether any attribute key is read at all.
+     * @returns false under "none"
+     */
+    get readsAttributes() {
+        return this.mode !== "none";
+    }
+    /**
+     * Write one attribute cell according to the policy.
+     * @param builder - the builder
+     * @param domain - "node" or "edge"
+     * @param row - the node index or logical edge index
+     * @param key - the record key
+     * @param value - the cell value
+     */
+    write(builder, domain, row, key, value) {
+        switch (this.mode) {
+            case "none":
+                return;
+            case "infer":
+                if (domain === "node") {
+                    builder.setNodeValue(key, row, value);
+                }
+                else {
+                    builder.setEdgeValue(key, row, value);
+                }
+                return;
+            case "json":
+            case "declared": {
+                const handle = this.handleOf(builder, domain, key);
+                if (handle === null) {
+                    return;
+                }
+                if (domain === "node") {
+                    builder.setNodeValue(handle, row, value);
+                }
+                else {
+                    builder.setEdgeValue(handle, row, value);
+                }
+                return;
+            }
+            default: {
+                const name = this.mode;
+                throw new GraphFormatError("E_UNSUPPORTED", `unknown attribute mode ${name}`, { found: name });
+            }
+        }
+    }
+    /**
+     * The handle of a key's column in one table, declaring it on first use: a json column under
+     * "json", the caller's declaration under "declared" (an undeclared key has no column).
+     * @param builder - the builder
+     * @param domain - "node" or "edge"
+     * @param key - the record key
+     * @returns the handle, or null when the key is not stored
+     */
+    handleOf(builder, domain, key) {
+        const cache = this.handles[domain];
+        const cached = cache.get(key);
+        if (cached !== undefined) {
+            return cached;
+        }
+        let decl;
+        if (this.mode === "json") {
+            decl = { name: key, dtype: "json" };
+        }
+        else {
+            const declared = this.declared.get(key);
+            if (declared === undefined) {
+                return null;
+            }
+            decl = declared;
+        }
+        const handle = domain === "node" ? builder.declareNodeColumn(decl) : builder.declareEdgeColumn(decl);
+        cache.set(key, handle);
+        return handle;
+    }
+}
+/**
+ * Resolve the keys and rules of a RecordsInput with their defaults.
+ * @param input - the input
+ * @returns the rules
+ */
+function rulesOf(input) {
+    return {
+        nodeId: input.nodeId === undefined ? "id" : input.nodeId,
+        edgeSource: input.edgeSource,
+        edgeTarget: input.edgeTarget,
+        edgeWeight: input.edgeWeight === undefined ? "weight" : input.edgeWeight,
+        ids: assertOneOf("ids", input.ids, ["keep", "canonical", "string", "number"]) ?? "keep",
+        attributes: new AttributePolicy(input.columns),
+    };
+}
+/**
+ * Resolve a positional endpoint (nodeId null: endpoints are node indices, design section 8.1): a
+ * non-negative integer below the builder's node bound, or -- under addMissingNodes -- one that
+ * extends the anonymous node range.
+ * @param builder - the builder
+ * @param value - the cell value
+ * @param field - "source" or "target"
+ * @param edge - the record's position, for the error
+ * @returns the node index
+ */
+function positionalEndpoint(builder, value, field, edge) {
+    if (typeof value !== "number" || !Number.isInteger(value) || value < 0) {
+        throw new GraphFormatError("E_INVALID_ID", `edge record ${edge}: ${field} ${String(value)} is not a node index`, {
+            field,
+            found: value,
+            edge,
+            reason: "not an index",
+        });
+    }
+    const bound = builder.nodeBound;
+    if (value >= bound) {
+        if (!builder.options.addMissingNodes) {
+            throw new GraphFormatError("E_UNKNOWN_NODE", `edge record ${edge}: node index ${value} does not exist`, {
+                index: value,
+                field,
+                edge,
+            });
+        }
+        builder.addAnonymousNodes(value - bound + 1);
+    }
+    return value;
+}
+/**
+ * Read the weight cell of an edge record: absent, undefined and null mean "no weight" (1 in a
+ * weighted graph, design section 3.7); anything else must be a number.
+ * @param record - the edge record
+ * @param key - the weight key
+ * @param edge - the record's position, for the error
+ * @returns the weight, or undefined when omitted
+ */
+function weightOf(record, key, edge) {
+    if (!hasKey(record, key)) {
+        return undefined;
+    }
+    const raw = record[key];
+    if (raw === undefined || raw === null) {
+        return undefined;
+    }
+    if (typeof raw !== "number") {
+        throw new GraphFormatError("E_INVALID_WEIGHT", `edge record ${edge}: weight "${key}" is not a number`, {
+            key,
+            found: typeof raw,
+            edge,
+        });
+    }
+    return raw;
+}
+/**
+ * Push the node records.
+ * @param builder - the builder
+ * @param rules - the resolved rules
+ * @param nodes - the node records
+ */
+function pushNodes(builder, rules, nodes) {
+    const { nodeId, attributes } = rules;
+    let position = 0;
+    for (const record of nodes) {
+        let index;
+        if (nodeId === null) {
+            index = builder.addAnonymousNodes(1);
+        }
+        else {
+            if (!hasKey(record, nodeId)) {
+                throw new GraphFormatError("E_INVALID_ID", `node record ${position} has no "${nodeId}" key`, {
+                    field: nodeId,
+                    node: position,
+                    reason: "missing id",
+                });
+            }
+            index = builder.addNode(coerceId(record[nodeId], rules.ids, nodeId));
+        }
+        if (attributes.readsAttributes) {
+            for (const key of Object.keys(record)) {
+                if (key !== nodeId) {
+                    attributes.write(builder, "node", index, key, record[key]);
+                }
+            }
+        }
+        position++;
+    }
+}
+/**
+ * Push the edge records.
+ * @param builder - the builder
+ * @param rules - the resolved rules
+ * @param edges - the edge records
+ */
+function pushEdges(builder, rules, edges) {
+    const { nodeId, edgeWeight, attributes } = rules;
+    let position = 0;
+    for (const record of edges) {
+        const source = endpointOf(record, rules.edgeSource, SOURCE_KEYS);
+        const target = endpointOf(record, rules.edgeTarget, TARGET_KEYS);
+        if (source.key === null) {
+            throw missingEndpoint("source", rules.edgeSource === undefined ? SOURCE_KEYS : [rules.edgeSource], position);
+        }
+        if (target.key === null) {
+            throw missingEndpoint("target", rules.edgeTarget === undefined ? TARGET_KEYS : [rules.edgeTarget], position);
+        }
+        const weight = edgeWeight === null ? undefined : weightOf(record, edgeWeight, position);
+        let edge;
+        if (nodeId === null) {
+            const u = positionalEndpoint(builder, source.value, "source", position);
+            const v = positionalEndpoint(builder, target.value, "target", position);
+            edge = builder.addEdgeByIndex(u, v, weight);
+        }
+        else {
+            edge = builder.addEdge(coerceId(source.value, rules.ids, "source"), coerceId(target.value, rules.ids, "target"), weight);
+        }
+        if (attributes.readsAttributes) {
+            for (const key of Object.keys(record)) {
+                if (key !== source.key && key !== target.key && key !== edgeWeight) {
+                    attributes.write(builder, "edge", edge, key, record[key]);
+                }
+            }
+        }
+        position++;
+    }
+}
+/**
+ * Build a snapshot from node-link records (design section 8.1): node records (optional; every node
+ * an edge names is created under addMissingNodes, the default) and edge records, pushed into a
+ * GraphBuilder one scalar at a time and frozen. The node id comes from `nodeId` ("id" by default;
+ * null makes the node index the record position and the endpoints indices, the d3 v3 shape), the
+ * endpoints from `edgeSource` / `edgeTarget` ("source" / "target" by default, falling back to "src"
+ * / "from" and "dst" / "to"), the weight from `edgeWeight` ("weight" by default; null = unweighted).
+ * Every other key becomes an attribute column per `columns`: "infer" (default) lets the builder
+ * infer and widen per column (design section 5.1), "json" stores each key as a json column, "none"
+ * loads only the structure, and a ColumnDecl list stores only the declared keys. Ids are coerced per
+ * `ids` ("keep" by default). The staging weight precision defaults to f64 so a JSON weight such as
+ * 0.1 is never corrupted (the shadow column costs nothing when every value is f32-exact); pass
+ * `weightDtype: "f32"` to opt out.
+ * @param input - the records and keys; a record without its id or an endpoint, or with an id the
+ *   coercion rule cannot convert, is E_INVALID_ID; a non-numeric weight is E_INVALID_WEIGHT; an
+ *   unknown endpoint under addMissingNodes false is E_UNKNOWN_NODE
+ * @param options - builder policies and freeze options
+ * @returns the snapshot and the freeze report (its `widened` entries name the inferred columns that
+ *   widened while the records were read)
+ */
+export function fromRecords(input, options = {}) {
+    const rules = rulesOf(input);
+    const split = splitOptions(input.directed, options);
+    const builderOptions = {
+        ...split.builder,
+        weightDtype: options.weightDtype ?? "f64",
+    };
+    const builder = new GraphBuilder(builderOptions);
+    if (input.nodes !== undefined) {
+        pushNodes(builder, rules, input.nodes);
+    }
+    pushEdges(builder, rules, input.edges);
+    return builder.freezeWithReport(split.freeze);
+}
+//# sourceMappingURL=from-records.js.map

package/dist/src/populate/from-records.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"from-records.js","sourceRoot":"","sources":["../../../src/populate/from-records.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAahD,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAKrD,8EAA8E;AAC9E,MAAM,WAAW,GAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAEjE,8EAA8E;AAC9E,MAAM,WAAW,GAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAE/D,wDAAwD;AACxD,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAEhD,mEAAmE;AAEnE;;;;;;GAMG;AACH,SAAS,MAAM,CAAC,MAAiB,EAAE,GAAW;IAC1C,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,KAAa,EAAE,KAAc,EAAE,IAAgB;IAC9D,OAAO,IAAI,gBAAgB,CACvB,cAAc,EACd,GAAG,KAAK,kBAAkB,OAAO,KAAK,6BAA6B,IAAI,GAAG,EAC1E;QACI,KAAK;QACL,KAAK,EAAE,OAAO,KAAK;QACnB,IAAI;KACP,CACJ,CAAC;AACN,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAc,EAAE,IAAgB,EAAE,KAAa;IACpE,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,MAAM;YACP,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACzD,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,MAAM,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxC,KAAK,WAAW;YACZ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,6EAA6E;gBAC7E,IAAI,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBAClD,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBACxB,OAAO,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC/C,CAAC;gBACD,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,MAAM,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxC,KAAK,QAAQ;YACT,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,IACI,OAAO,KAAK,KAAK,QAAQ;gBACzB,OAAO,KAAK,KAAK,SAAS;gBAC1B,OAAO,KAAK,KAAK,QAAQ;gBACzB,KAAK,KAAK,IAAI,EAChB,CAAC;gBACC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxC,KAAK,QAAQ;YACT,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACxC,OAAO,CAAC,CAAC,CAAC;YACN,MAAM,IAAI,GAAW,IAAI,CAAC;YAC1B,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,wBAAwB,IAAI,GAAG,EAAE;gBACzE,KAAK,EAAE,KAAK;gBACZ,KAAK,EAAE,IAAI;gBACX,MAAM,EAAE,oBAAoB;aAC/B,CAAC,CAAC;QACP,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CACf,MAAiB,EACjB,QAA4B,EAC5B,QAA2B;IAE3B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxF,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAa,EAAE,IAAuB,EAAE,IAAY;IACzE,OAAO,IAAI,gBAAgB,CACvB,cAAc,EACd,eAAe,IAAI,WAAW,KAAK,iBAAiB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EACtE;QACI,KAAK;QACL,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;QACf,IAAI;QACJ,MAAM,EAAE,kBAAkB;KAC7B,CACJ,CAAC;AACN,CAAC;AAED,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,eAAe;IAOjB;;;OAGG;IACH,YAAY,OAAgC;QACxC,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;QACpD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YAC/C,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;YAC1B,OAAO;QACX,CAAC;QACD,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;YAC1B,OAAO;QACX,CAAC;QACD,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC9B,mFAAmF;YACnF,MAAM,KAAK,GAAW,OAAO,CAAC;YAC9B,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,+BAA+B,KAAK,GAAG,EAAE;gBACjF,KAAK,EAAE,SAAS;gBAChB,KAAK;gBACL,MAAM,EAAE,oBAAoB;aAC/B,CAAC,CAAC;QACP,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC/C,MAAM,IAAI,GAA0B,OAAO,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,6CAA6C,EAAE;oBACvF,KAAK,EAAE,MAAM;oBACb,KAAK,EAAE,IAAI,CAAC,IAAI;iBACnB,CAAC,CAAC;YACP,CAAC;YACD,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,gBAAgB,CAAC,iBAAiB,EAAE,WAAW,IAAI,CAAC,IAAI,qBAAqB,EAAE;oBACrF,MAAM,EAAE,IAAI,CAAC,IAAI;iBACpB,CAAC,CAAC;YACP,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,IAAI,eAAe;QACf,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,OAAqB,EAAE,MAAuB,EAAE,GAAW,EAAE,GAAW,EAAE,KAAc;QAC1F,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAChB,KAAK,MAAM;gBACP,OAAO;YACX,KAAK,OAAO;gBACR,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oBACpB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC1C,CAAC;qBAAM,CAAC;oBACJ,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC1C,CAAC;gBACD,OAAO;YACX,KAAK,MAAM,CAAC;YACZ,KAAK,UAAU,CAAC,CAAC,CAAC;gBACd,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;gBACnD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBAClB,OAAO;gBACX,CAAC;gBACD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oBACpB,OAAO,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;qBAAM,CAAC;oBACJ,OAAO,CAAC,YAAY,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;gBACD,OAAO;YACX,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACN,MAAM,IAAI,GAAW,IAAI,CAAC,IAAI,CAAC;gBAC/B,MAAM,IAAI,gBAAgB,CAAC,eAAe,EAAE,0BAA0B,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YACnG,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACK,QAAQ,CAAC,OAAqB,EAAE,MAAuB,EAAE,GAAW;QACxE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,MAAM,CAAC;QAClB,CAAC;QACD,IAAI,IAAgB,CAAC;QACrB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACvB,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACxC,CAAC;aAAM,CAAC;YACJ,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,GAAG,QAAQ,CAAC;QACpB,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACrG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAsBD;;;;GAIG;AACH,SAAS,OAAO,CAAC,KAAmB;IAChC,OAAO;QACH,MAAM,EAAE,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM;QACxD,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,UAAU,EAAE,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU;QACxE,GAAG,EAAE,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAU,CAAC,IAAI,MAAM;QAChG,UAAU,EAAE,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC;KACjD,CAAC;AACN,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,kBAAkB,CAAC,OAAqB,EAAE,KAAc,EAAE,KAAa,EAAE,IAAY;IAC1F,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACrE,MAAM,IAAI,gBAAgB,CACtB,cAAc,EACd,eAAe,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,sBAAsB,EACpE;YACI,KAAK;YACL,KAAK,EAAE,KAAK;YACZ,IAAI;YACJ,MAAM,EAAE,cAAc;SACzB,CACJ,CAAC;IACN,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC;IAChC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC;YACnC,MAAM,IAAI,gBAAgB,CAAC,gBAAgB,EAAE,eAAe,IAAI,gBAAgB,KAAK,iBAAiB,EAAE;gBACpG,KAAK,EAAE,KAAK;gBACZ,KAAK;gBACL,IAAI;aACP,CAAC,CAAC;QACP,CAAC;QACD,OAAO,CAAC,iBAAiB,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,QAAQ,CAAC,MAAiB,EAAE,GAAW,EAAE,IAAY;IAC1D,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QACpC,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC1B,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,EAAE,eAAe,IAAI,aAAa,GAAG,mBAAmB,EAAE;YACnG,GAAG;YACH,KAAK,EAAE,OAAO,GAAG;YACjB,IAAI;SACP,CAAC,CAAC;IACP,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,OAAqB,EAAE,KAAkB,EAAE,KAA0B;IACpF,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAa,CAAC;QAClB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,gBAAgB,CAAC,cAAc,EAAE,eAAe,QAAQ,YAAY,MAAM,OAAO,EAAE;oBACzF,KAAK,EAAE,MAAM;oBACb,IAAI,EAAE,QAAQ;oBACd,MAAM,EAAE,YAAY;iBACvB,CAAC,CAAC;YACP,CAAC;YACD,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;oBACjB,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;QACD,QAAQ,EAAE,CAAC;IACf,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAAC,OAAqB,EAAE,KAAkB,EAAE,KAA0B;IACpF,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IACjD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACjE,IAAI,MAAM,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACtB,MAAM,eAAe,CACjB,QAAQ,EACR,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EACjE,QAAQ,CACX,CAAC;QACN,CAAC;QACD,IAAI,MAAM,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACtB,MAAM,eAAe,CACjB,QAAQ,EACR,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EACjE,QAAQ,CACX,CAAC;QACN,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACxF,IAAI,IAAY,CAAC;QACjB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxE,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACxE,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACJ,IAAI,GAAG,OAAO,CAAC,OAAO,CAClB,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,EAC3C,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,EAC3C,MAAM,CACT,CAAC;QACN,CAAC;QACD,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,IAAI,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;oBACjE,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9D,CAAC;YACL,CAAC;QACL,CAAC;QACD,QAAQ,EAAE,CAAC;IACf,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,WAAW,CACvB,KAAmB,EACnB,UAA+C,EAAE;IAEjD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACpD,MAAM,cAAc,GAAwB;QACxC,GAAG,KAAK,CAAC,OAAO;QAChB,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,KAAK;KAC5C,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IACjD,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC5B,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IACD,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,OAAO,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAClD,CAAC"}

package/dist/src/snapshot/derived.d.ts

@@ -0,0 +1,211 @@
+/**
+ * Derived graphs (design section 7.3): `toUndirected`, `transpose`, `simplified`, `withoutSelfLoops`,
+ * `filterEdges`, `inducedSubgraph`, `contract`, `relabel` and `withColumns`, each returning the
+ * `SnapshotParts` of a NEW snapshot plus the index maps back to the source (`DerivedParts`), and the
+ * `renumberPartition` helper of design section 7.5. GraphSnapshot wraps the parts with
+ * `createSnapshot()`; this module imports the class type only, so there is no runtime cycle.
+ *
+ * Every derived core is built by `buildCore()`, the two stable counting-sort passes of design section
+ * 6.3 steps 3-6 over a per-logical-edge list (src, dst, weight) in declared orientation, into a fresh
+ * 256-aligned arena (section 10.3), so every derived snapshot inherits invariants I1-I10 by
+ * construction and `flags` are computed by the one predicate set in validate.ts (I9).
+ *
+ * Index-map conventions (design section 7.3): `nodeOrigin` / `edgeOrigin` are NEW -> SOURCE,
+ * `nodeRemap` / `edgeRemap` SOURCE -> NEW with INVALID_INDEX for a dropped row and the SURVIVOR's new
+ * index for a merged edge; each map is null exactly when its index space is unchanged (same length,
+ * identity). New edges are numbered in ascending order of their survivor's source index, so relative
+ * edge order is preserved (I14). Attribute tables follow the propagation table of design section
+ * 5.11: same node space -> the SAME `AttributeTable` instance; gathered otherwise; `refersTo` values
+ * rewritten through the matching remap.
+ */
+import { type ArenaLayout, type ColumnInput, type ContractOptions, type EdgeListView, type EdgeMask, type F32, type GraphSnapshot, type NodeMask, type ReverseView, type SimplifyOptions, type SnapshotFlags, type ToUndirectedOptions, type TypedArrayData, type U32 } from "../types/index.js";
+import { type SnapshotParts } from "../types/internal.js";
+/** The report of a derived graph: how many source edges were dropped and how many merged into a survivor. */
+interface DerivedReport {
+    /** Source edges with no counterpart in the derived graph. */
+    readonly droppedEdges: number;
+    /** Source edges collapsed into another edge (the survivor). */
+    readonly mergedEdges: number;
+}
+/**
+ * What a derive function returns: the parts of the new snapshot (null when the operation is the
+ * identity and the caller returns the source itself) and the maps of `DerivedGraph`.
+ */
+export interface DerivedParts {
+    /** The parts of the new snapshot, or null for "return this". */
+    readonly parts: SnapshotParts | null;
+    /** New node index -> source node index, or null when the node space is unchanged. */
+    readonly nodeOrigin: U32 | null;
+    /** New edge index -> source edge index (survivor), or null when the edge space is unchanged. */
+    readonly edgeOrigin: U32 | null;
+    /** Source node index -> new node index or INVALID_INDEX, or null when unchanged. */
+    readonly nodeRemap: U32 | null;
+    /** Source edge index -> new edge index (survivor) or INVALID_INDEX, or null when unchanged. */
+    readonly edgeRemap: U32 | null;
+    /** contract only: source nodes per block. */
+    readonly blockSizes: U32 | null;
+    /** Dropped and merged edge counts. */
+    readonly report: DerivedReport;
+}
+/**
+ * The DerivedParts of an identity operation: the caller returns the source snapshot itself.
+ * @returns parts null, every map null, an empty report
+ */
+export declare function identityDerived(): DerivedParts;
+/** A per-logical-edge description of a graph in declared orientation: the input of `buildCore()`. */
+interface EdgeArrays {
+    /** Whether the graph is directed. */
+    readonly directed: boolean;
+    /** The node count. */
+    readonly nodeCount: number;
+    /** The logical edge count. */
+    readonly edgeCount: number;
+    /** Declared source of every edge. */
+    readonly src: U32;
+    /** Declared target of every edge. */
+    readonly dst: U32;
+    /** Per-edge f32 weights, or null when unweighted. */
+    readonly weights: F32 | null;
+}
+/** The core a `buildCore()` call produces: exactly the core fields of SnapshotParts. */
+interface BuiltCore {
+    /** colIdx.length. */
+    readonly arcCount: number;
+    /** Logical edges with source === target. */
+    readonly selfLoopCount: number;
+    /** nodeCount + 1 row offsets. */
+    readonly rowPtr: U32;
+    /** Sorted targets. */
+    readonly colIdx: U32;
+    /** Per-arc weights, or null. */
+    readonly weights: F32 | null;
+    /** arcCount entries, or null when the permutation is the identity. */
+    readonly arcToEdge: U32 | null;
+    /** edgeCount entries, or null when the permutation is the identity. */
+    readonly edgeToArc: U32 | null;
+    /** The truthful flags (I9). */
+    readonly flags: SnapshotFlags;
+    /** The arena the arrays are views into, or null when `arena: false`. */
+    readonly arena: ArenaLayout | null;
+}
+/** Options of `buildCore()`. */
+interface BuildCoreOptions {
+    /** Allocate the arrays inside one 256-aligned arena (default true) or as separate buffers. */
+    readonly arena?: boolean | undefined;
+}
+/**
+ * Build the core of a derived graph from a per-logical-edge list in declared orientation: the two
+ * stable counting-sort passes of design section 6.3 steps 3-6 (`sortIntoCore` of the builder module,
+ * so derived graphs and freezes share one implementation), into a fresh 256-aligned arena unless
+ * `arena: false`. Invariants I1-I10 hold by construction and the flags are computed from the stored
+ * values (I9). A NaN weight (a reducer summing +Infinity and -Infinity) is E_INVALID_WEIGHT (I8).
+ * @param edges - the per-edge arrays; only the first `edgeCount` entries are read
+ * @param options - arena or separate buffers
+ * @returns the core, the counts and the flags
+ */
+export declare function buildCore(edges: EdgeArrays, options?: BuildCoreOptions): BuiltCore;
+/**
+ * `filterEdges(keep)`: the logical edges whose mask bit is set (design section 7.3).
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @param keep - packed bitmap over logical edges; E_MASK_LENGTH when short
+ * @returns the derived parts
+ */
+export declare function deriveFilterEdges(source: GraphSnapshot, list: EdgeListView, keep: EdgeMask): DerivedParts;
+/**
+ * `withoutSelfLoops()`: every edge with source !== target (design section 7.3).
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @returns the derived parts
+ */
+export declare function deriveWithoutSelfLoops(source: GraphSnapshot, list: EdgeListView): DerivedParts;
+/**
+ * `inducedSubgraph(selection)`: the subgraph on a node selection with every edge whose endpoints are
+ * both kept (design section 7.3); a compact new node space unless the selection is the identity.
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @param selection - an index list (new index order) or a packed mask (ascending)
+ * @returns the derived parts
+ */
+export declare function deriveInducedSubgraph(source: GraphSnapshot, list: EdgeListView, selection: U32 | {
+    readonly mask: NodeMask;
+}): DerivedParts;
+/**
+ * `relabel(perm)`: the node space permuted with `perm[newIndex] = oldIndex`, edge order preserved
+ * (design section 7.3); E_INVALID_PERMUTATION unless perm is a permutation of 0..n-1.
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @param perm - the permutation
+ * @returns the derived parts
+ */
+export declare function deriveRelabel(source: GraphSnapshot, list: EdgeListView, perm: U32): DerivedParts;
+/**
+ * `toUndirected(options)` on a directed snapshot (design section 7.3): every edge becomes undirected;
+ * reciprocal pairs u -> v / v -> u (paired k-th to k-th among parallels, in edge order) collapse to
+ * one edge keeping the lower index's row and the reduced weight (default "first"); with
+ * `reciprocal: true` only paired edges survive. Self-loops are kept.
+ * @param source - a directed snapshot
+ * @param list - the source edge list
+ * @param options - reciprocal filtering and the weight reducer
+ * @returns the derived parts
+ */
+export declare function deriveToUndirected(source: GraphSnapshot, list: EdgeListView, options?: ToUndirectedOptions): DerivedParts;
+/**
+ * `transpose()` on a directed snapshot (design section 7.3): the orientation of every edge swapped by
+ * adopting the reverse view's arrays as the core (zero copy, so `arena` is null); node and edge
+ * spaces unchanged, tables shared.
+ * @param source - a directed snapshot
+ * @param reverse - its reverse view
+ * @returns the derived parts
+ */
+export declare function deriveTranspose(source: GraphSnapshot, reverse: ReverseView): DerivedParts;
+/**
+ * `simplified(options)` (design section 7.3): one edge per (u, v) group (parallels are adjacent by
+ * I4; undirected groups are unordered pairs), survivor = lowest index, weights per `weights`
+ * (default "first"), self-loops kept or dropped, other edge columns per `edgeReducers` (default: the
+ * survivor's row). `flags.multigraph` is false afterwards.
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @param options - reducers and self-loop policy
+ * @returns the derived parts
+ */
+export declare function deriveSimplified(source: GraphSnapshot, list: EdgeListView, options?: SimplifyOptions): DerivedParts;
+/**
+ * Renumber an arbitrary u32 labelling to dense 0..k-1 in first-seen order (design section 7.5; what
+ * `contract()` does with non-dense labels). INVALID_INDEX is not a legal label (E_PARTITION).
+ * @param labels - the labels
+ * @param out - an optional destination of the same length (may be `labels` itself)
+ * @returns the dense labels and the block count
+ */
+export declare function renumberPartition(labels: U32, out?: U32): {
+    readonly labels: U32;
+    readonly count: number;
+};
+/**
+ * `contract(partition, options)` (design section 7.3): the nodes of each block become one node (block
+ * indices as labels, ids 0..k-1), every source edge contributes once: an inter-block edge becomes an
+ * edge block(u) -> block(v), an intra-block edge one self-loop with weight w, kept or dropped per
+ * `selfLoops`; parallels merge per `parallel` with the `weights` reducer (default "sum"; on an
+ * unweighted source "sum" materialises multiplicities). Node and edge columns are kept only through
+ * `nodeReducers` / `edgeReducers`.
+ * @param source - the source snapshot
+ * @param list - the source edge list
+ * @param partition - one label per node; E_PARTITION for a wrong length or an INVALID_INDEX label
+ * @param options - the contraction options
+ * @returns the derived parts with blockSizes
+ */
+export declare function deriveContract(source: GraphSnapshot, list: EdgeListView, partition: U32, options?: ContractOptions): DerivedParts;
+/**
+ * `withColumns(nodes, edges)` (design section 7.3): the parts of a snapshot sharing the core, the id
+ * map and the SERIAL of the source with a CLONED column set plus the given columns (the graph table is
+ * cloned too; extension tables are shared).
+ * @param source - the source snapshot
+ * @param nodes - node columns to add, keyed by name
+ * @param edges - edge columns to add, keyed by name
+ * @param arcToEdge - the source's permutation arrays as the constructor holds them (null when identity)
+ * @param edgeToArc - see arcToEdge
+ * @returns the parts
+ */
+export declare function withColumnsParts(source: GraphSnapshot, nodes: Readonly<Record<string, TypedArrayData | ColumnInput>> | undefined, edges: Readonly<Record<string, TypedArrayData | ColumnInput>> | undefined, arcToEdge: U32 | null, edgeToArc: U32 | null): SnapshotParts;
+export {};
+//# sourceMappingURL=derived.d.ts.map