@graphty/graph-samples 0.0.1 → 0.1.1

package/dist/src/generators/variants.d.ts

@@ -0,0 +1,85 @@
+/**
+ * Structural variants for testing consumers: random multigraphs, a helper that adds self-loops,
+ * parallel and anti-parallel edges to any graph, and a pack of small (and a few huge) edge-case
+ * graphs that parsers, loaders and algorithms must survive.
+ */
+import { type SampleGraph } from "../types.js";
+import { type WeightOptions } from "./weights.js";
+/** Options of {@link randomMultigraph}. */
+export interface RandomMultigraphOptions extends WeightOptions {
+    /** The node count, >= 1 (>= 2 without self-loops). */
+    n: number;
+    /** The edge count, >= 0. */
+    m: number;
+    /** Whether the edges are directed; default false. */
+    directed?: boolean | undefined;
+    /** Whether an edge may join a node to itself; default true. */
+    selfLoops?: boolean | undefined;
+    /** The seed, an integer in [0, 2^53); default 0. */
+    seed?: number | undefined;
+}
+/**
+ * A random multigraph: m edges, each an independent uniform ordered pair (u, v) -- drawn with
+ * replacement, so parallel edges and (when allowed) self-loops are kept. Undirected, this is the
+ * "each endpoint uniform" model: a given self-loop is half as likely as a given pair u != v. Edge e
+ * draws u = nextBelow(n) and then v = nextBelow(n), or v = nextBelow(n - 1) shifted past u when
+ * self-loops are off, from the stream (seed, "multigraph", 0); one sequential stream, since two
+ * draws per edge are cheaper than a per-edge stream derivation. O(m).
+ * @param options - n, m, directed, selfLoops and seed
+ * @returns the multigraph
+ */
+export declare function randomMultigraph(options: RandomMultigraphOptions): SampleGraph;
+/** Options of {@link addPathologicalEdges}. */
+export interface PathologicalEdgeOptions {
+    /** How many self-loops to add at uniform nodes; default 0. */
+    selfLoops?: number | undefined;
+    /** How many copies of uniform existing edges to add; default 0. */
+    parallelEdges?: number | undefined;
+    /** How many reversed copies of uniform existing arcs to add (directed graphs only); default 0. */
+    antiParallelEdges?: number | undefined;
+    /** The seed, an integer in [0, 2^53); default 0. */
+    seed?: number | undefined;
+}
+/**
+ * A copy of `graph` with pathological edges appended after its own, in this order: `selfLoops`
+ * self-loops (v, v) at v = nextBelow(nodeCount); `parallelEdges` copies of edge e =
+ * nextBelow(original edge count); `antiParallelEdges` reversed copies (dst[e], src[e]) of
+ * e = nextBelow(original edge count). Copies are only ever of the original edges. Draws come from
+ * the stream (seed, "pathological", 0) in that order. A weighted graph's copies keep the copied
+ * edge's weight and a self-loop gets weight 1. `ids` and `nodeColumns` are shared, not copied.
+ * O(m + added).
+ * @param graph - the graph
+ * @param options - the counts and the seed
+ * @returns the new graph
+ */
+export declare function addPathologicalEdges(graph: SampleGraph, options: PathologicalEdgeOptions): SampleGraph;
+/** The names of the {@link edgeCaseGraph} cases. */
+export declare const EDGE_CASE_NAMES: readonly ["empty", "single-node", "single-self-loop", "isolated-nodes", "disconnected", "pathological-undirected", "pathological-directed", "zero-weights", "negative-weights", "negative-cycle", "duplicate-heavy", "max-node-index", "star-100k", "path-100k"];
+/** One of {@link EDGE_CASE_NAMES}. */
+export type EdgeCaseName = (typeof EDGE_CASE_NAMES)[number];
+/**
+ * An edge-case graph for testing parsers, loaders and algorithms. Every case loads with
+ * graph-format's `fromEdgeArrays` default options, and each call returns fresh arrays.
+ *
+ * - `empty`: 0 nodes, 0 edges.
+ * - `single-node`: 1 node, no edges.
+ * - `single-self-loop`: 1 node with a self-loop.
+ * - `isolated-nodes`: 10 nodes, no edges.
+ * - `disconnected`: a triangle, a 3-node path, one edge and 2 isolated nodes (5 components).
+ * - `pathological-undirected`: a self-loop, a triple parallel edge (one written reversed), weights
+ *   0, negative and fractional.
+ * - `pathological-directed`: a self-loop, parallel arcs, an anti-parallel pair (a 2-cycle), a
+ *   negative-weight cycle reachable from 0, zero and negative weights.
+ * - `zero-weights`: a 4-cycle plus a chord, all weights 0.
+ * - `negative-weights`: a DAG with negative weights and no negative cycle (Bellman-Ford, DAG
+ *   shortest paths); distances from 0 are [0, 4, 1, 4, 3].
+ * - `negative-cycle`: a directed cycle of total weight -1 reachable from node 0.
+ * - `duplicate-heavy`: 1,000 copies of the edge (0, 1).
+ * - `max-node-index`: 2^20 nodes, 3 edges touching nodes 0, 1, 2^20 - 2 and 2^20 - 1.
+ * - `star-100k`: a hub with 100,000 leaves (degree extremes).
+ * - `path-100k`: a 100,000-node path (deep recursion, long diameters).
+ * @param name - the case
+ * @returns the graph
+ */
+export declare function edgeCaseGraph(name: EdgeCaseName): SampleGraph;
+//# sourceMappingURL=variants.d.ts.map

package/dist/src/generators/variants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"variants.d.ts","sourceRoot":"","sources":["../../../src/generators/variants.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAEhE,2CAA2C;AAC3C,MAAM,WAAW,uBAAwB,SAAQ,aAAa;IAC1D,sDAAsD;IACtD,CAAC,EAAE,MAAM,CAAC;IACV,4BAA4B;IAC5B,CAAC,EAAE,MAAM,CAAC;IACV,qDAAqD;IACrD,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAC/B,+DAA+D;IAC/D,SAAS,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAChC,oDAAoD;IACpD,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,uBAAuB,GAAG,WAAW,CA0B9E;AAED,+CAA+C;AAC/C,MAAM,WAAW,uBAAuB;IACpC,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,mEAAmE;IACnE,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,kGAAkG;IAClG,iBAAiB,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACvC,oDAAoD;IACpD,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,uBAAuB,GAAG,WAAW,CA6CtG;AAED,oDAAoD;AACpD,eAAO,MAAM,eAAe,kQAelB,CAAC;AAEX,sCAAsC;AACtC,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC;AAsE5D;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,GAAG,WAAW,CAK7D"}

package/dist/src/generators/variants.js

@@ -0,0 +1,215 @@
+/**
+ * Structural variants for testing consumers: random multigraphs, a helper that adds self-loops,
+ * parallel and anti-parallel edges to any graph, and a pack of small (and a few huge) edge-case
+ * graphs that parsers, loaders and algorithms must survive.
+ */
+import { RandomStream, resolveSeed } from "../random/stream.js";
+import { checkEdgeCount, checkInt } from "./util.js";
+import { applyWeights } from "./weights.js";
+/**
+ * A random multigraph: m edges, each an independent uniform ordered pair (u, v) -- drawn with
+ * replacement, so parallel edges and (when allowed) self-loops are kept. Undirected, this is the
+ * "each endpoint uniform" model: a given self-loop is half as likely as a given pair u != v. Edge e
+ * draws u = nextBelow(n) and then v = nextBelow(n), or v = nextBelow(n - 1) shifted past u when
+ * self-loops are off, from the stream (seed, "multigraph", 0); one sequential stream, since two
+ * draws per edge are cheaper than a per-edge stream derivation. O(m).
+ * @param options - n, m, directed, selfLoops and seed
+ * @returns the multigraph
+ */
+export function randomMultigraph(options) {
+    const { n, m } = options;
+    const loops = options.selfLoops ?? true;
+    checkInt("n", n, 1);
+    checkInt("m", m, 0);
+    if (!loops && n < 2) {
+        throw new RangeError(`selfLoops: false needs n >= 2, got ${n}`);
+    }
+    const stream = new RandomStream(resolveSeed(options.seed), "multigraph", 0);
+    const src = new Uint32Array(m);
+    const dst = new Uint32Array(m);
+    for (let e = 0; e < m; e++) {
+        const u = stream.nextBelow(n);
+        let v;
+        if (loops) {
+            v = stream.nextBelow(n);
+        }
+        else {
+            v = stream.nextBelow(n - 1);
+            if (v >= u) {
+                v++;
+            }
+        }
+        src[e] = u;
+        dst[e] = v;
+    }
+    return applyWeights({ directed: options.directed ?? false, nodeCount: n, src, dst }, options);
+}
+/**
+ * A copy of `graph` with pathological edges appended after its own, in this order: `selfLoops`
+ * self-loops (v, v) at v = nextBelow(nodeCount); `parallelEdges` copies of edge e =
+ * nextBelow(original edge count); `antiParallelEdges` reversed copies (dst[e], src[e]) of
+ * e = nextBelow(original edge count). Copies are only ever of the original edges. Draws come from
+ * the stream (seed, "pathological", 0) in that order. A weighted graph's copies keep the copied
+ * edge's weight and a self-loop gets weight 1. `ids` and `nodeColumns` are shared, not copied.
+ * O(m + added).
+ * @param graph - the graph
+ * @param options - the counts and the seed
+ * @returns the new graph
+ */
+export function addPathologicalEdges(graph, options) {
+    const loops = options.selfLoops ?? 0;
+    const parallel = options.parallelEdges ?? 0;
+    const anti = options.antiParallelEdges ?? 0;
+    checkInt("selfLoops", loops, 0);
+    checkInt("parallelEdges", parallel, 0);
+    checkInt("antiParallelEdges", anti, 0);
+    if (anti > 0 && !graph.directed) {
+        throw new RangeError("antiParallelEdges needs a directed graph");
+    }
+    const m = graph.src.length;
+    if (loops > 0 && graph.nodeCount === 0) {
+        throw new RangeError("selfLoops needs a graph with at least one node");
+    }
+    if (parallel + anti > 0 && m === 0) {
+        throw new RangeError("parallelEdges and antiParallelEdges need a graph with at least one edge");
+    }
+    const total = m + loops + parallel + anti;
+    checkEdgeCount(total);
+    const stream = new RandomStream(resolveSeed(options.seed), "pathological", 0);
+    const src = new Uint32Array(total);
+    const dst = new Uint32Array(total);
+    src.set(graph.src);
+    dst.set(graph.dst);
+    const weights = graph.weights === undefined ? undefined : new Float32Array(total);
+    weights?.set(graph.weights ?? []);
+    let e = m;
+    for (let i = 0; i < loops; i++, e++) {
+        const v = stream.nextBelow(graph.nodeCount);
+        src[e] = v;
+        dst[e] = v;
+        if (weights !== undefined) {
+            weights[e] = 1;
+        }
+    }
+    for (let i = 0; i < parallel + anti; i++, e++) {
+        const f = stream.nextBelow(m);
+        const reversed = i >= parallel;
+        src[e] = reversed ? graph.dst[f] : graph.src[f];
+        dst[e] = reversed ? graph.src[f] : graph.dst[f];
+        if (weights !== undefined) {
+            weights[e] = weights[f];
+        }
+    }
+    return { ...graph, src, dst, weights };
+}
+/** The names of the {@link edgeCaseGraph} cases. */
+export const EDGE_CASE_NAMES = [
+    "empty",
+    "single-node",
+    "single-self-loop",
+    "isolated-nodes",
+    "disconnected",
+    "pathological-undirected",
+    "pathological-directed",
+    "zero-weights",
+    "negative-weights",
+    "negative-cycle",
+    "duplicate-heavy",
+    "max-node-index",
+    "star-100k",
+    "path-100k",
+];
+/**
+ * A small graph from a flat edge list.
+ * @param directed - whether the edges are directed
+ * @param nodeCount - the node count
+ * @param edges - [u, v, u, v, ...], or [u, v, w, u, v, w, ...] when weighted
+ * @param weighted - whether every edge carries a weight
+ * @returns the graph
+ */
+function build(directed, nodeCount, edges, weighted = false) {
+    const stride = weighted ? 3 : 2;
+    const m = edges.length / stride;
+    const src = new Uint32Array(m);
+    const dst = new Uint32Array(m);
+    const weights = new Float32Array(weighted ? m : 0);
+    for (let e = 0; e < m; e++) {
+        src[e] = edges[e * stride];
+        dst[e] = edges[e * stride + 1];
+        weights[e] = weighted ? edges[e * stride + 2] : 0;
+    }
+    return weighted ? { directed, nodeCount, src, dst, weights } : { directed, nodeCount, src, dst };
+}
+/**
+ * A graph whose edge e is end(e) for e < m.
+ * @param nodeCount - the node count
+ * @param m - the edge count
+ * @param end - maps e to [source, target]
+ * @returns the undirected graph
+ */
+function generated(nodeCount, m, end) {
+    const src = new Uint32Array(m);
+    const dst = new Uint32Array(m);
+    for (let e = 0; e < m; e++) {
+        [src[e], dst[e]] = end(e);
+    }
+    return { directed: false, nodeCount, src, dst };
+}
+const CASES = {
+    empty: () => build(false, 0, []),
+    "single-node": () => build(false, 1, []),
+    "single-self-loop": () => build(false, 1, [0, 0]),
+    "isolated-nodes": () => build(false, 10, []),
+    // triangle 0-1-2, path 3-4-5, edge 6-7, isolated 8 and 9
+    disconnected: () => build(false, 10, [0, 1, 1, 2, 2, 0, 3, 4, 4, 5, 6, 7]),
+    // self-loop at 0; (1, 2) three times, once written (2, 1); weights 0, negative and fractional
+    "pathological-undirected": () => build(false, 4, [0, 0, 1, 1, 2, 0, 1, 2, -2, 2, 1, 0.5, 2, 3, 2.5, 3, 0, -1], true),
+    // self-loop at 0; parallel arcs 0 -> 1; the 2-cycle 1 <-> 2 (an anti-parallel pair, one arc
+    // of weight 0); the negative cycle 2 -> 3 -> 4 -> 2 of total weight -2, reachable from 0
+    "pathological-directed": () => build(true, 5, [0, 0, 1, 0, 1, 2, 0, 1, 3, 1, 2, 1, 2, 1, 0, 2, 3, -1, 3, 4, -2, 4, 2, 1, 1, 3, 0.5], true),
+    // a 4-cycle with the chord 0-2, every weight 0: ties everywhere for Dijkstra and MST
+    "zero-weights": () => build(false, 4, [0, 1, 0, 1, 2, 0, 2, 3, 0, 3, 0, 0, 0, 2, 0], true),
+    // a DAG with negative arcs and no negative cycle; distances from 0 are [0, 4, 1, 4, 3]
+    "negative-weights": () => build(true, 5, [0, 1, 4, 0, 2, 2, 1, 2, -3, 1, 3, 2, 2, 3, 3, 3, 4, -1, 2, 4, 5], true),
+    // 0 -> 1, then the cycle 1 -> 2 -> 3 -> 1 of total weight -1
+    "negative-cycle": () => build(true, 4, [0, 1, 1, 1, 2, -1, 2, 3, -1, 3, 1, 1], true),
+    // 1,000 copies of the edge (0, 1)
+    "duplicate-heavy": () => generated(2, 1000, () => [0, 1]),
+    // 2^20 nodes, edges only at the ends: sparse index handling and large-id output
+    "max-node-index": () => build(false, 2 ** 20, [0, 1, 2 ** 20 - 2, 2 ** 20 - 1, 0, 2 ** 20 - 1]),
+    // hub 0 with 100,000 leaves
+    "star-100k": () => generated(100001, 100000, (e) => [0, e + 1]),
+    // the path 0 - 1 - ... - 99,999
+    "path-100k": () => generated(100000, 99999, (e) => [e, e + 1]),
+};
+/**
+ * An edge-case graph for testing parsers, loaders and algorithms. Every case loads with
+ * graph-format's `fromEdgeArrays` default options, and each call returns fresh arrays.
+ *
+ * - `empty`: 0 nodes, 0 edges.
+ * - `single-node`: 1 node, no edges.
+ * - `single-self-loop`: 1 node with a self-loop.
+ * - `isolated-nodes`: 10 nodes, no edges.
+ * - `disconnected`: a triangle, a 3-node path, one edge and 2 isolated nodes (5 components).
+ * - `pathological-undirected`: a self-loop, a triple parallel edge (one written reversed), weights
+ *   0, negative and fractional.
+ * - `pathological-directed`: a self-loop, parallel arcs, an anti-parallel pair (a 2-cycle), a
+ *   negative-weight cycle reachable from 0, zero and negative weights.
+ * - `zero-weights`: a 4-cycle plus a chord, all weights 0.
+ * - `negative-weights`: a DAG with negative weights and no negative cycle (Bellman-Ford, DAG
+ *   shortest paths); distances from 0 are [0, 4, 1, 4, 3].
+ * - `negative-cycle`: a directed cycle of total weight -1 reachable from node 0.
+ * - `duplicate-heavy`: 1,000 copies of the edge (0, 1).
+ * - `max-node-index`: 2^20 nodes, 3 edges touching nodes 0, 1, 2^20 - 2 and 2^20 - 1.
+ * - `star-100k`: a hub with 100,000 leaves (degree extremes).
+ * - `path-100k`: a 100,000-node path (deep recursion, long diameters).
+ * @param name - the case
+ * @returns the graph
+ */
+export function edgeCaseGraph(name) {
+    if (!EDGE_CASE_NAMES.includes(name)) {
+        throw new RangeError(`unknown edge case "${name}"; expected one of ${EDGE_CASE_NAMES.join(", ")}`);
+    }
+    return CASES[name]();
+}
+//# sourceMappingURL=variants.js.map

package/dist/src/generators/variants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"variants.js","sourceRoot":"","sources":["../../../src/generators/variants.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEhE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,YAAY,EAAsB,MAAM,cAAc,CAAC;AAgBhE;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAgC;IAC7D,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC;IACzB,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IACxC,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAS,CAAC;QACd,IAAI,KAAK,EAAE,CAAC;YACR,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACT,CAAC,EAAE,CAAC;YACR,CAAC;QACL,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,OAAO,YAAY,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,KAAK,EAAE,SAAS,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC;AAClG,CAAC;AAcD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAkB,EAAE,OAAgC;IACrF,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa,IAAI,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,OAAO,CAAC,iBAAiB,IAAI,CAAC,CAAC;IAC5C,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACvC,QAAQ,CAAC,mBAAmB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,IAAI,UAAU,CAAC,0CAA0C,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,UAAU,CAAC,yEAAyE,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC;IAC1C,cAAc,CAAC,KAAK,CAAC,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC;IAC9E,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACnC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnB,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IAClF,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC5C,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;IACL,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC;QAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IACD,OAAO,EAAE,GAAG,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AAC3C,CAAC;AAED,oDAAoD;AACpD,MAAM,CAAC,MAAM,eAAe,GAAG;IAC3B,OAAO;IACP,aAAa;IACb,kBAAkB;IAClB,gBAAgB;IAChB,cAAc;IACd,yBAAyB;IACzB,uBAAuB;IACvB,cAAc;IACd,kBAAkB;IAClB,gBAAgB;IAChB,iBAAiB;IACjB,gBAAgB;IAChB,WAAW;IACX,WAAW;CACL,CAAC;AAKX;;;;;;;GAOG;AACH,SAAS,KAAK,CAAC,QAAiB,EAAE,SAAiB,EAAE,KAAwB,EAAE,QAAQ,GAAG,KAAK;IAC3F,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACrG,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,SAAiB,EAAE,CAAS,EAAE,GAAoC;IACjF,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACpD,CAAC;AAED,MAAM,KAAK,GAA4C;IACnD,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;IAChC,aAAa,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;IACxC,kBAAkB,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,gBAAgB,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;IAC5C,yDAAyD;IACzD,YAAY,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,8FAA8F;IAC9F,yBAAyB,EAAE,GAAG,EAAE,CAC5B,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;IACvF,4FAA4F;IAC5F,yFAAyF;IACzF,uBAAuB,EAAE,GAAG,EAAE,CAC1B,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC;IAC/G,qFAAqF;IACrF,cAAc,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IAC1F,uFAAuF;IACvF,kBAAkB,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IACjH,6DAA6D;IAC7D,gBAAgB,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;IACpF,kCAAkC;IAClC,iBAAiB,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,gFAAgF;IAChF,gBAAgB,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/F,4BAA4B;IAC5B,WAAW,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,MAAO,EAAE,MAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,gCAAgC;IAChC,WAAW,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,MAAO,EAAE,KAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CACnE,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,aAAa,CAAC,IAAkB;IAC5C,IAAI,CAAE,eAAqC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAAC,sBAAsB,IAAI,sBAAsB,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvG,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AACzB,CAAC"}

package/dist/src/generators/weights.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Edge weights for any graph: the `weights` option every generator takes, and `withWeights` for a
+ * graph that already exists (a dataset, a hand-built graph).
+ */
+import { type SampleGraph } from "../types.js";
+/** How to combine the two endpoint values of a node column into an edge weight. */
+export type ColumnCombine = "source" | "target" | "sum" | "mean" | "product" | "min" | "max" | "difference";
+/**
+ * A weight distribution. Random kinds draw one value per edge, in edge order, from stream
+ * (seed, "weights", 0).
+ *
+ * - `uniform`: a real in [min, max) (default [0, 1)).
+ * - `integer`: an integer in [min, max], both ends included -- capacities, Dijkstra demos.
+ * - `exponential`: -mean ln(1 - u), mean default 1.
+ * - `euclidean`: the distance between the endpoints' `x`, `y` (and `z`, when present) node columns;
+ *   for the generators that emit positions.
+ * - `column`: from a numeric node column: the source's value, the target's, their sum, mean,
+ *   product, min, max, or the absolute difference.
+ */
+export type WeightSpec = {
+    readonly kind: "uniform";
+    readonly min?: number | undefined;
+    readonly max?: number | undefined;
+} | {
+    readonly kind: "integer";
+    readonly min: number;
+    readonly max: number;
+} | {
+    readonly kind: "exponential";
+    readonly mean?: number | undefined;
+} | {
+    readonly kind: "euclidean";
+} | {
+    readonly kind: "column";
+    readonly column: string;
+    readonly combine?: ColumnCombine | undefined;
+};
+/** The options every generator accepts on top of its own. */
+export interface WeightOptions {
+    /** Give every edge a weight from this distribution; absent means unweighted. */
+    weights?: WeightSpec | undefined;
+    /**
+     * The seed of the weight draws, an integer in [0, 2^53); default 0. Random generators share it
+     * with their structure (the weights use their own stream domain, so adding weights never changes
+     * the edges).
+     */
+    seed?: number | undefined;
+}
+/**
+ * A copy of `graph` (sharing its arrays) with edge weights drawn from `spec`. Any graph works: a
+ * generator's output, a dataset, a hand-built SampleGraph. Existing weights are replaced.
+ * @param graph - the graph
+ * @param spec - the distribution
+ * @param seed - the seed of the draws, default 0
+ * @returns the weighted graph
+ */
+export declare function withWeights(graph: SampleGraph, spec: WeightSpec, seed?: number): SampleGraph;
+/**
+ * Apply the common `weights` option, if set: the last step of every generator.
+ * @param graph - the generated graph
+ * @param options - the generator's options
+ * @returns the graph, weighted when asked
+ */
+export declare function applyWeights(graph: SampleGraph, options: WeightOptions): SampleGraph;
+//# sourceMappingURL=weights.d.ts.map

package/dist/src/generators/weights.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"weights.d.ts","sourceRoot":"","sources":["../../../src/generators/weights.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C,mFAAmF;AACnF,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG,YAAY,CAAC;AAE5G;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,UAAU,GAChB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GAClG;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GACxE;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACpE;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;CAAE,GAC9B;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAA;CAAE,CAAC;AAEzG,6DAA6D;AAC7D,MAAM,WAAW,aAAa;IAC1B,gFAAgF;IAChF,OAAO,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC;IACjC;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B;AAiHD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,WAAW,CAE5F;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,GAAG,WAAW,CAEpF"}

package/dist/src/generators/weights.js

@@ -0,0 +1,135 @@
+/**
+ * Edge weights for any graph: the `weights` option every generator takes, and `withWeights` for a
+ * graph that already exists (a dataset, a hand-built graph).
+ */
+import { detLog } from "../random/log.js";
+import { RandomStream, resolveSeed } from "../random/stream.js";
+/**
+ * A numeric node column of the graph, or a RangeError naming it.
+ * @param graph - the graph
+ * @param name - the column name
+ * @returns the column's values
+ */
+function numericColumn(graph, name) {
+    const column = graph.nodeColumns?.[name];
+    if (column === undefined || !ArrayBuffer.isView(column)) {
+        throw new RangeError(`weights: the graph has no numeric node column "${name}"`);
+    }
+    return column;
+}
+/**
+ * The weight of every edge under `spec`.
+ * @param graph - the graph
+ * @param spec - the distribution
+ * @param seed - the seed (already resolved)
+ * @returns one weight per edge
+ */
+function drawWeights(graph, spec, seed) {
+    const m = graph.src.length;
+    const out = new Float32Array(m);
+    const { src, dst } = graph;
+    const stream = new RandomStream(seed, "weights", 0);
+    switch (spec.kind) {
+        case "uniform": {
+            const min = spec.min ?? 0;
+            const max = spec.max ?? 1;
+            if (!(Number.isFinite(min) && Number.isFinite(max) && min <= max)) {
+                throw new RangeError(`weights: uniform needs finite min <= max, got ${min} and ${max}`);
+            }
+            for (let e = 0; e < m; e++) {
+                out[e] = min + (max - min) * stream.nextFloat();
+            }
+            break;
+        }
+        case "integer": {
+            const { min, max } = spec;
+            if (!(Number.isSafeInteger(min) && Number.isSafeInteger(max) && min <= max)) {
+                throw new RangeError(`weights: integer needs integers min <= max, got ${min} and ${max}`);
+            }
+            for (let e = 0; e < m; e++) {
+                out[e] = min + stream.nextBelow(max - min + 1);
+            }
+            break;
+        }
+        case "exponential": {
+            const mean = spec.mean ?? 1;
+            if (!(mean > 0 && Number.isFinite(mean))) {
+                throw new RangeError(`weights: exponential needs a positive mean, got ${mean}`);
+            }
+            for (let e = 0; e < m; e++) {
+                out[e] = -mean * detLog(1 - stream.nextFloat());
+            }
+            break;
+        }
+        case "euclidean": {
+            const x = numericColumn(graph, "x");
+            const y = numericColumn(graph, "y");
+            const z = graph.nodeColumns?.z === undefined ? null : numericColumn(graph, "z");
+            for (let e = 0; e < m; e++) {
+                const dx = x[src[e]] - x[dst[e]];
+                const dy = y[src[e]] - y[dst[e]];
+                const dz = z === null ? 0 : z[src[e]] - z[dst[e]];
+                out[e] = Math.sqrt(dx * dx + dy * dy + dz * dz);
+            }
+            break;
+        }
+        default: {
+            const values = numericColumn(graph, spec.column);
+            const combine = spec.combine ?? "sum";
+            for (let e = 0; e < m; e++) {
+                const a = values[src[e]];
+                const b = values[dst[e]];
+                out[e] = combineValues(combine, a, b);
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Combine two endpoint values.
+ * @param combine - the rule
+ * @param a - the source value
+ * @param b - the target value
+ * @returns the weight
+ */
+function combineValues(combine, a, b) {
+    switch (combine) {
+        case "source":
+            return a;
+        case "target":
+            return b;
+        case "sum":
+            return a + b;
+        case "mean":
+            return (a + b) / 2;
+        case "product":
+            return a * b;
+        case "min":
+            return Math.min(a, b);
+        case "max":
+            return Math.max(a, b);
+        default:
+            return Math.abs(a - b);
+    }
+}
+/**
+ * A copy of `graph` (sharing its arrays) with edge weights drawn from `spec`. Any graph works: a
+ * generator's output, a dataset, a hand-built SampleGraph. Existing weights are replaced.
+ * @param graph - the graph
+ * @param spec - the distribution
+ * @param seed - the seed of the draws, default 0
+ * @returns the weighted graph
+ */
+export function withWeights(graph, spec, seed) {
+    return { ...graph, weights: drawWeights(graph, spec, resolveSeed(seed)) };
+}
+/**
+ * Apply the common `weights` option, if set: the last step of every generator.
+ * @param graph - the generated graph
+ * @param options - the generator's options
+ * @returns the graph, weighted when asked
+ */
+export function applyWeights(graph, options) {
+    return options.weights === undefined ? graph : withWeights(graph, options.weights, options.seed);
+}
+//# sourceMappingURL=weights.js.map

package/dist/src/generators/weights.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"weights.js","sourceRoot":"","sources":["../../../src/generators/weights.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAqChE;;;;;GAKG;AACH,SAAS,aAAa,CAAC,KAAkB,EAAE,IAAY;IACnD,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACtD,MAAM,IAAI,UAAU,CAAC,kDAAkD,IAAI,GAAG,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,KAAkB,EAAE,IAAgB,EAAE,IAAY;IACnE,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;IACpD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,SAAS,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;gBAChE,MAAM,IAAI,UAAU,CAAC,iDAAiD,GAAG,QAAQ,GAAG,EAAE,CAAC,CAAC;YAC5F,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;YACpD,CAAC;YACD,MAAM;QACV,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;YAC1B,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1E,MAAM,IAAI,UAAU,CAAC,mDAAmD,GAAG,QAAQ,GAAG,EAAE,CAAC,CAAC;YAC9F,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;YACnD,CAAC;YACD,MAAM;QACV,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACvC,MAAM,IAAI,UAAU,CAAC,mDAAmD,IAAI,EAAE,CAAC,CAAC;YACpF,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YACpD,CAAC;YACD,MAAM;QACV,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACpD,CAAC;YACD,MAAM;QACV,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACN,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,OAAsB,EAAE,CAAS,EAAE,CAAS;IAC/D,QAAQ,OAAO,EAAE,CAAC;QACd,KAAK,QAAQ;YACT,OAAO,CAAC,CAAC;QACb,KAAK,QAAQ;YACT,OAAO,CAAC,CAAC;QACb,KAAK,KAAK;YACN,OAAO,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM;YACP,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,KAAK,SAAS;YACV,OAAO,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,KAAK;YACN,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,KAAK,KAAK;YACN,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B;YACI,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,KAAkB,EAAE,IAAgB,EAAE,IAAa;IAC3E,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,OAAsB;IACnE,OAAO,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;AACrG,CAAC"}

package/dist/src/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * `@graphty/graph-samples`: the shared types, the dataset catalogue, the loader for hosted
+ * datasets and the conversion to graphty-element records. The generators live in
+ * `@graphty/graph-samples/generators` and each bundled dataset in
+ * `@graphty/graph-samples/datasets/<name>`, so an application bundles only what it imports.
+ */
+export { type DatasetMeta } from "./datasets/build.js";
+export { DATASETS } from "./datasets/catalog.js";
+export { DEFAULT_DATASET_BASE_URL, fetchDataset, type FetchDatasetOptions } from "./datasets/remote.js";
+export { type ElementData, toElementData } from "./element.js";
+export { type SampleGraph } from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,KAAK,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AACxG,OAAO,EAAE,KAAK,WAAW,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,YAAY,CAAC"}

package/dist/src/index.js

@@ -0,0 +1,10 @@
+/**
+ * `@graphty/graph-samples`: the shared types, the dataset catalogue, the loader for hosted
+ * datasets and the conversion to graphty-element records. The generators live in
+ * `@graphty/graph-samples/generators` and each bundled dataset in
+ * `@graphty/graph-samples/datasets/<name>`, so an application bundles only what it imports.
+ */
+export { DATASETS } from "./datasets/catalog.js";
+export { DEFAULT_DATASET_BASE_URL, fetchDataset } from "./datasets/remote.js";
+export { toElementData } from "./element.js";
+//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAA4B,MAAM,sBAAsB,CAAC;AACxG,OAAO,EAAoB,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/src/random/exp.d.ts

@@ -0,0 +1,23 @@
+/**
+ * An exponential and the power functions built on it, returning the same bits on every JavaScript
+ * engine: a port of fdlibm's `__ieee754_exp` (e_exp.c, Sun Microsystems 1993), for the same reason
+ * and with the same technique as `detLog` in log.ts -- the exponent is read and written through a
+ * little-endian DataView and everything else is IEEE-754 double addition, subtraction,
+ * multiplication and division, which ECMAScript requires to be correctly rounded. Error below 1 ulp.
+ */
+/**
+ * e^x, bit-identical across engines.
+ * @param x - the argument
+ * @returns e^x; +Infinity above about 709.78, 0 below about -745.13, NaN for NaN
+ */
+export declare function detExp(x: number): number;
+/**
+ * x^y as `detExp(y * detLog(x))` for x > 0: deterministic, not correctly rounded (the relative
+ * error grows with |y ln x|, about 1e-13 for the magnitudes the generators use). 0^y is 0 for
+ * y > 0.
+ * @param x - the base, >= 0
+ * @param y - the exponent
+ * @returns x^y
+ */
+export declare function detPow(x: number, y: number): number;
+//# sourceMappingURL=exp.d.ts.map

package/dist/src/random/exp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"exp.d.ts","sourceRoot":"","sources":["../../../src/random/exp.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AA8BH;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CA4CxC;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAQnD"}