graphbox 1.2.2 → 1.3.0

package/dist/experiments/proofs/test-utils.d.ts

@@ -0,0 +1,161 @@
+import { Graph } from '../../algorithms/graph/graph';
+import { Edge, Node } from '../../algorithms/types/graph';
+import { GraphExpander, Neighbor } from '../../interfaces/graph-expander';
+/**
+ * Test node with optional attributes for MI computation.
+ */
+export interface ProofTestNode extends Node {
+    id: string;
+    type: string;
+    degree?: number;
+    attributes?: number[];
+}
+/**
+ * Test edge with optional weight and MI override.
+ */
+export interface ProofTestEdge extends Edge {
+    id: string;
+    source: string;
+    target: string;
+    type: string;
+    weight?: number;
+    /** Override MI value for testing specific scenarios */
+    miOverride?: number;
+}
+/**
+ * Test implementation of GraphExpander for proof tests.
+ * Wraps a Graph instance to provide the expansion interface.
+ */
+export declare class ProofTestExpander implements GraphExpander<ProofTestNode> {
+    private readonly directed;
+    private adjacency;
+    private degrees;
+    private nodes;
+    private discoveredEdges;
+    constructor(edges: Array<[string, string]>, directed?: boolean);
+    getNeighbors(nodeId: string): Promise<Neighbor[]>;
+    getDegree(nodeId: string): number;
+    getNode(nodeId: string): Promise<ProofTestNode | null>;
+    addEdge(source: string, target: string, relationshipType: string): void;
+    calculatePriority(nodeId: string, options?: {
+        nodeWeight?: number;
+        epsilon?: number;
+    }): number;
+    getNodeCount(): number;
+    getAllNodeIds(): string[];
+    getDiscoveredEdges(): Array<{
+        source: string;
+        target: string;
+        relationshipType: string;
+    }>;
+    clearDiscoveredEdges(): void;
+}
+/**
+ * Creates a linear chain graph: N0 -- N1 -- N2 -- ... -- N(n-1)
+ * @param length
+ */
+export declare const createChainGraph: (length: number) => ProofTestExpander;
+/**
+ * Creates a star graph with a central hub connected to all spokes.
+ * @param numSpokes
+ * @param numberSpokes
+ */
+export declare const createStarGraph: (numberSpokes: number) => ProofTestExpander;
+/**
+ * Creates a grid (lattice) graph of rows × cols.
+ * @param rows
+ * @param cols
+ */
+export declare const createGridGraph: (rows: number, cols: number) => ProofTestExpander;
+/**
+ * Creates a complete graph K_n where every node connects to every other node.
+ * @param n
+ */
+export declare const createCompleteGraph: (n: number) => ProofTestExpander;
+/**
+ * Creates a tree graph with specified branching factor and depth.
+ * @param branchingFactor
+ * @param depth
+ */
+export declare const createTreeGraph: (branchingFactor: number, depth: number) => ProofTestExpander;
+/**
+ * Creates a graph with multiple disconnected components.
+ * @param numComponents
+ * @param numberComponents
+ * @param nodesPerComponent
+ */
+export declare const createDisconnectedGraph: (numberComponents: number, nodesPerComponent: number) => ProofTestExpander;
+/**
+ * Creates a cycle graph: N0 -- N1 -- N2 -- ... -- N(n-1) -- N0
+ * @param n
+ */
+export declare const createCycleGraph: (n: number) => ProofTestExpander;
+/**
+ * Creates an Erdős-Rényi random graph G(n, p).
+ * Each edge exists independently with probability p.
+ * @param n
+ * @param p
+ * @param seed
+ */
+export declare const createErdosRenyiGraph: (n: number, p: number, seed?: number) => ProofTestExpander;
+/**
+ * Creates a Barabási-Albert preferential attachment graph.
+ * @param n
+ * @param m
+ * @param seed
+ */
+export declare const createBarabasiAlbertGraph: (n: number, m: number, seed?: number) => ProofTestExpander;
+/**
+ * Creates a Graph instance for path ranking tests.
+ * @param edges
+ * @param directed
+ */
+export declare const createTestGraph: (edges: Array<{
+    source: string;
+    target: string;
+    weight?: number;
+    type?: string;
+}>, directed?: boolean) => Graph<ProofTestNode, ProofTestEdge>;
+/**
+ * Creates a Graph with explicit MI values for edges.
+ * Used for testing path ranking properties.
+ * @param edges
+ * @param directed
+ */
+export declare const createTestGraphWithMI: (edges: Array<{
+    source: string;
+    target: string;
+    miOverride: number;
+}>, directed?: boolean) => Graph<ProofTestNode, ProofTestEdge>;
+/**
+ * Creates a mock MI cache with specified values.
+ * @param miValues
+ */
+export declare const createMockMICache: (miValues: Map<string, number>) => {
+    get: (id: string) => number | undefined;
+    keys: () => IterableIterator<string>;
+    size: number;
+};
+/**
+ * Creates a seeded pseudo-random number generator.
+ * Uses mulberry32 algorithm for deterministic results.
+ * @param seed
+ */
+export declare const createSeededRng: (seed: number) => (() => number);
+/**
+ * Computes the geometric mean of an array of positive numbers.
+ * @param values
+ */
+export declare const geometricMean: (values: number[]) => number;
+/**
+ * Checks if two sets contain the same elements.
+ * @param a
+ * @param b
+ */
+export declare const setsEqual: <T>(a: Set<T>, b: Set<T>) => boolean;
+/**
+ * Computes union of multiple sets.
+ * @param sets
+ */
+export declare const setUnion: <T>(...sets: Set<T>[]) => Set<T>;
+//# sourceMappingURL=test-utils.d.ts.map

package/dist/experiments/proofs/test-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-utils.d.ts","sourceRoot":"","sources":["../../../src/experiments/proofs/test-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AACrD,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAM/E;;GAEG;AACH,MAAM,WAAW,aAAc,SAAQ,IAAI;IAC1C,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,aAAc,SAAQ,IAAI;IAC1C,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,uDAAuD;IACvD,UAAU,CAAC,EAAE,MAAM,CAAC;CACpB;AAMD;;;GAGG;AACH,qBAAa,iBAAkB,YAAW,aAAa,CAAC,aAAa,CAAC;IAQpE,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAP1B,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,eAAe,CAA2E;gBAGjG,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACb,QAAQ,UAAQ;IAuC5B,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIvD,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAI3B,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;IAI5D,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI;IAIvE,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,MAAM;IAMlG,YAAY,IAAI,MAAM;IAItB,aAAa,IAAI,MAAM,EAAE;IAIzB,kBAAkB,IAAI,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IAIzF,oBAAoB,IAAI,IAAI;CAG5B;AAMD;;;GAGG;AACH,eAAO,MAAM,gBAAgB,GAAI,QAAQ,MAAM,KAAG,iBAMjD,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,cAAc,MAAM,KAAG,iBAMtD,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,MAAM,EAAE,MAAM,MAAM,KAAG,iBAkB5D,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,mBAAmB,GAAI,GAAG,MAAM,KAAG,iBAQ/C,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,iBAAiB,MAAM,EAAE,OAAO,MAAM,KAAG,iBAiBxE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,GACnC,kBAAkB,MAAM,EACxB,mBAAmB,MAAM,KACvB,iBAWF,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,gBAAgB,GAAI,GAAG,MAAM,KAAG,iBAM5C,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,qBAAqB,GACjC,GAAG,MAAM,EACT,GAAG,MAAM,EACT,OAAO,MAAM,KACX,iBAeF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,yBAAyB,GACrC,GAAG,MAAM,EACT,GAAG,MAAM,EACT,OAAO,MAAM,KACX,iBA4CF,CAAC;AAMF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAC3B,OAAO,KAAK,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,EAChF,kBAAgB,KACd,KAAK,CAAC,aAAa,EAAE,aAAa,CA4BpC,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,GACjC,OAAO,KAAK,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,EACpE,kBAAgB,KACd,KAAK,CAAC,aAAa,EAAE,aAAa,CA8BpC,CAAC;AAMF;;;GAGG;AACH,eAAO,MAAM,iBAAiB,GAC7B,UAAU,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,KAC3B;IAAE,GAAG,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAM/F,CAAC;AAMF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,MAAM,KAAG,CAAC,MAAM,MAAM,CAQ3D,CAAC;AA2DF;;;GAGG;AACH,eAAO,MAAM,aAAa,GAAI,QAAQ,MAAM,EAAE,KAAG,MAMhD,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,KAAG,OAMnD,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,KAAG,GAAG,CAAC,CAAC,CAQpD,CAAC"}

package/dist/experiments/run-experiments.d.ts

@@ -0,0 +1,19 @@
+#!/usr/bin/env tsx
+/**
+ * Experiment Orchestrator
+ *
+ * Runs all experiments and generates test-metrics.json for LaTeX table generation.
+ * This script completely replaces the fragile console-output parsing approach.
+ *
+ * Usage:
+ *   npx tsx src/experiments/run-experiments.ts
+ *   npx tsx src/experiments/run-experiments.ts --output ../Thesis/content/tables/test-metrics.json
+ *
+ * Experiments run:
+ *   1. Bidirectional BFS (Degree-Prioritised vs baselines)
+ *   2. Seeded Expansion (N=1, N=2, N>=3 variants)
+ *   3. Path Salience Ranking (MI-based ranking)
+ *   4. Salience Coverage Comparison (Novel algorithms vs baselines)
+ */
+export {};
+//# sourceMappingURL=run-experiments.d.ts.map

package/dist/experiments/run-experiments.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-experiments.d.ts","sourceRoot":"","sources":["../../src/experiments/run-experiments.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;;;GAeG"}

package/dist/experiments/suts/degree-sum-ranking-sut.d.ts

@@ -0,0 +1,52 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Degree Sum Ranking SUT.
+ */
+export interface DegreeSumRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Traversal mode: 'directed' or 'undirected' */
+    traversalMode?: "directed" | "undirected";
+}
+/**
+ * Degree sum ranking result.
+ */
+export interface DegreeSumRankingResult {
+    pathsFound: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        mi: number;
+    }>;
+}
+/**
+ * Degree Sum Ranking SUT (baseline).
+ *
+ * Ranks paths between source and target nodes by sum of node degrees.
+ */
+export declare class DegreeSumRankingSUT {
+    readonly id = "degree-sum-ranking-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: DegreeSumRankingConfig);
+    /**
+     * Execute degree sum path ranking.
+     */
+    run(): Promise<Result<DegreeSumRankingResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=degree-sum-ranking-sut.d.ts.map

package/dist/experiments/suts/degree-sum-ranking-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"degree-sum-ranking-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/degree-sum-ranking-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iDAAiD;IACjD,aAAa,CAAC,EAAE,UAAU,GAAG,YAAY,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAED;;;;GAIG;AACH,qBAAa,mBAAmB;IAC/B,QAAQ,CAAC,EAAE,+BAA+B;IAC1C,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmC;gBAErD,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,sBAA2B;IAW5G;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,sBAAsB,EAAE,KAAK,CAAC,CAAC;IA2C3D;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAazB"}

package/dist/experiments/suts/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Ranking SUTs
+ *
+ * System Under Test implementations for path ranking algorithms.
+ * Integrates Path Salience Ranking and baselines into PPEF framework.
+ */
+export { type DegreeSumRankingConfig, type DegreeSumRankingResult, DegreeSumRankingSUT } from './degree-sum-ranking-sut.js';
+export { type JaccardArithmeticRankingConfig, type JaccardArithmeticRankingResult, JaccardArithmeticRankingSUT } from './jaccard-arithmetic-ranking-sut.js';
+export { type PageRankSumRankingConfig, type PageRankSumRankingResult, PageRankSumRankingSUT } from './pagerank-sum-ranking-sut.js';
+export { type PathSalienceConfig, type PathSalienceResult, PathSalienceSUT } from './path-salience-sut.js';
+export { type RandomRankingConfig, type RandomRankingResult, RandomRankingSUT } from './random-ranking-sut.js';
+export { type ShortestRankingConfig, type ShortestRankingResult, ShortestRankingSUT } from './shortest-ranking-sut.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/experiments/suts/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,sBAAsB,EAAE,KAAK,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAC5H,OAAO,EAAE,KAAK,8BAA8B,EAAE,KAAK,8BAA8B,EAAE,2BAA2B,EAAE,MAAM,qCAAqC,CAAC;AAC5J,OAAO,EAAE,KAAK,wBAAwB,EAAE,KAAK,wBAAwB,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AACpI,OAAO,EAAE,KAAK,kBAAkB,EAAE,KAAK,kBAAkB,EAAC,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAC1G,OAAO,EAAE,KAAK,mBAAmB,EAAE,KAAK,mBAAmB,EAAC,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC9G,OAAO,EAAE,KAAK,qBAAqB,EAAE,KAAK,qBAAqB,EAAC,kBAAkB,EAAE,MAAM,2BAA2B,CAAC"}

package/dist/experiments/suts/jaccard-arithmetic-ranking-sut.d.ts

@@ -0,0 +1,52 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Jaccard Arithmetic Ranking SUT.
+ */
+export interface JaccardArithmeticRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Traversal mode: 'directed' or 'undirected' */
+    traversalMode?: "directed" | "undirected";
+}
+/**
+ * Jaccard arithmetic ranking result.
+ */
+export interface JaccardArithmeticRankingResult {
+    pathsFound: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        mi: number;
+    }>;
+}
+/**
+ * Jaccard Arithmetic Ranking SUT (baseline).
+ *
+ * Ranks paths between source and target nodes by Jaccard arithmetic similarity.
+ */
+export declare class JaccardArithmeticRankingSUT {
+    readonly id = "jaccard-arithmetic-ranking-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: JaccardArithmeticRankingConfig);
+    /**
+     * Execute Jaccard arithmetic path ranking.
+     */
+    run(): Promise<Result<JaccardArithmeticRankingResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=jaccard-arithmetic-ranking-sut.d.ts.map

package/dist/experiments/suts/jaccard-arithmetic-ranking-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"jaccard-arithmetic-ranking-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/jaccard-arithmetic-ranking-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,8BAA8B;IAC9C,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iDAAiD;IACjD,aAAa,CAAC,EAAE,UAAU,GAAG,YAAY,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,8BAA8B;IAC9C,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAED;;;;GAIG;AACH,qBAAa,2BAA2B;IACvC,QAAQ,CAAC,EAAE,uCAAuC;IAClD,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA2C;gBAE7D,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,8BAAmC;IAWpH;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;IA2CnE;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAazB"}

package/dist/experiments/suts/pagerank-sum-ranking-sut.d.ts

@@ -0,0 +1,52 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for PageRank Sum Ranking SUT.
+ */
+export interface PageRankSumRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Traversal mode: 'directed' or 'undirected' */
+    traversalMode?: "directed" | "undirected";
+}
+/**
+ * PageRank sum ranking result.
+ */
+export interface PageRankSumRankingResult {
+    pathsFound: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        mi: number;
+    }>;
+}
+/**
+ * PageRank Sum Ranking SUT (baseline).
+ *
+ * Ranks paths between source and target nodes by sum of PageRank scores.
+ */
+export declare class PageRankSumRankingSUT {
+    readonly id = "pagerank-sum-ranking-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: PageRankSumRankingConfig);
+    /**
+     * Execute PageRank sum path ranking.
+     */
+    run(): Promise<Result<PageRankSumRankingResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=pagerank-sum-ranking-sut.d.ts.map

package/dist/experiments/suts/pagerank-sum-ranking-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank-sum-ranking-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/pagerank-sum-ranking-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACxC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iDAAiD;IACjD,aAAa,CAAC,EAAE,UAAU,GAAG,YAAY,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAED;;;;GAIG;AACH,qBAAa,qBAAqB;IACjC,QAAQ,CAAC,EAAE,iCAAiC;IAC5C,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAqC;gBAEvD,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,wBAA6B;IAW9G;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;IA2C7D;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAazB"}

package/dist/experiments/suts/path-salience-sut.d.ts

@@ -0,0 +1,62 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Path Salience Ranking SUT.
+ */
+export interface PathSalienceConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Traversal mode: 'directed' or 'undirected' */
+    traversalMode?: "directed" | "undirected";
+    /** Length penalty parameter λ */
+    lambda?: number;
+}
+/**
+ * Internal path ranking inputs.
+ */
+export interface PathRankingInputs {
+    graph: BenchmarkGraphExpander;
+    source: string;
+    target: string;
+}
+/**
+ * Path Salience ranking result.
+ */
+export interface PathSalienceResult {
+    pathsFound: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        mi: number;
+    }>;
+}
+/**
+ * Path Salience Ranking SUT implementation.
+ *
+ * Ranks paths between source and target nodes using mutual information.
+ */
+export declare class PathSalienceSUT {
+    readonly id = "path-salience-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: PathSalienceConfig);
+    /**
+     * Execute path ranking.
+     */
+    run(): Promise<Result<PathSalienceResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=path-salience-sut.d.ts.map

package/dist/experiments/suts/path-salience-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-salience-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/path-salience-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAClC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iDAAiD;IACjD,aAAa,CAAC,EAAE,UAAU,GAAG,YAAY,CAAC;IAC1C,iCAAiC;IACjC,MAAM,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAED;;;;GAIG;AACH,qBAAa,eAAe;IAC3B,QAAQ,CAAC,EAAE,0BAA0B;IACrC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA+B;gBAEjD,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,kBAAuB;IAYxG;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAC;IA4CvD;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAazB"}

package/dist/experiments/suts/random-ranking-sut.d.ts

@@ -0,0 +1,52 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Random Path Ranking SUT.
+ */
+export interface RandomRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Random seed for reproducibility */
+    seed?: number;
+}
+/**
+ * Random ranking result.
+ */
+export interface RandomRankingResult {
+    pathsFound: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        mi: number;
+    }>;
+}
+/**
+ * Random Path Ranking SUT (statistical null hypothesis).
+ *
+ * Ranks paths between source and target nodes using random selection.
+ */
+export declare class RandomRankingSUT {
+    readonly id = "random-ranking-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: RandomRankingConfig);
+    /**
+     * Execute random path ranking.
+     */
+    run(): Promise<Result<RandomRankingResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=random-ranking-sut.d.ts.map

package/dist/experiments/suts/random-ranking-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-ranking-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/random-ranking-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,mBAAmB;IACnC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sCAAsC;IACtC,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IACnC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1D;AAED;;;;GAIG;AACH,qBAAa,gBAAgB;IAC5B,QAAQ,CAAC,EAAE,2BAA2B;IACtC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAgC;gBAElD,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,mBAAwB;IAWzG;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAC;IA2CxD;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAazB"}

package/dist/experiments/suts/shortest-ranking-sut.d.ts

@@ -0,0 +1,51 @@
+import { Result } from '../../algorithms/types/result.js';
+import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Shortest Path Ranking SUT.
+ */
+export interface ShortestRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+}
+/**
+ * Shortest ranking result.
+ */
+export interface ShortestRankingResult {
+    pathsFound: number;
+    meanLength: number;
+    meanMI: number;
+    stdMI: number;
+    pathDiversity: number;
+    hubAvoidance: number;
+    nodeCoverage: number;
+    meanScore: number;
+    stdScore: number;
+    paths: Array<{
+        id: string;
+        nodes: string[];
+        length: number;
+    }>;
+}
+/**
+ * Shortest Path Ranking SUT (conventional baseline).
+ *
+ * Ranks paths between source and target nodes by length (shortest first).
+ */
+export declare class ShortestRankingSUT {
+    readonly id = "shortest-ranking-v1.0.0";
+    readonly config: Readonly<Record<string, unknown>>;
+    private readonly expander;
+    private readonly source;
+    private readonly target;
+    private readonly rankingConfig;
+    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: ShortestRankingConfig);
+    /**
+     * Execute shortest path ranking.
+     */
+    run(): Promise<Result<ShortestRankingResult, Error>>;
+    /**
+     * Create an empty result (no paths found).
+     */
+    private createEmptyResult;
+}
+//# sourceMappingURL=shortest-ranking-sut.d.ts.map

package/dist/experiments/suts/shortest-ranking-sut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-ranking-sut.d.ts","sourceRoot":"","sources":["../../../src/experiments/suts/shortest-ranking-sut.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAqB,KAAK,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uEAAuE,CAAC;AASpH;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACrC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACrC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC9D;AAED;;;;GAIG;AACH,qBAAa,kBAAkB;IAC9B,QAAQ,CAAC,EAAE,6BAA6B;IACxC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAyB;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAkC;gBAEpD,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,GAAE,qBAA0B;IAU3G;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC;IA+C1D;;OAEG;IACH,OAAO,CAAC,iBAAiB;CAczB"}

package/dist/generation/generators/density-helpers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"density-helpers.d.ts","sourceRoot":"","sources":["../../../src/generation/generators/density-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGlD;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,SAAS,KAAG,OAuDnD,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,GACrC,OAAO,QAAQ,EAAE,EACjB,OAAO,QAAQ,EAAE,EACjB,MAAM,SAAS,KACb,MAkCF,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,GAC9B,OAAO,QAAQ,EAAE,EACjB,OAAO,QAAQ,EAAE,EACjB,MAAM,SAAS,EACf,kBAAkB,MAAM,KACtB,MAwBF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,KAAG,OAIlE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAI,YAAY,MAAM,EAAE,aAAa,MAAM,KAAG,MAGxE,CAAC"}
+{"version":3,"file":"density-helpers.d.ts","sourceRoot":"","sources":["../../../src/generation/generators/density-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGlD;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,SAAS,KAAG,OA4DnD,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,GACrC,OAAO,QAAQ,EAAE,EACjB,OAAO,QAAQ,EAAE,EACjB,MAAM,SAAS,KACb,MAkCF,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,kBAAkB,GAC9B,OAAO,QAAQ,EAAE,EACjB,OAAO,QAAQ,EAAE,EACjB,MAAM,SAAS,EACf,kBAAkB,MAAM,KACtB,MAwBF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,KAAG,OAIlE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAI,YAAY,MAAM,EAAE,aAAa,MAAM,KAAG,MAGxE,CAAC"}

package/dist/generation/generators/edge-generator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"edge-generator.d.ts","sourceRoot":"","sources":["../../../src/generation/generators/edge-generator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAqFzC,OAAO,EAAE,YAAY,EAAE,KAAK,QAAQ,EAAE,KAAK,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGrE;;;;;;;;GAQG;AACH,QAAA,MAAM,qBAAqB,GAAI,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,EAAE,SAAS,qBAAqB,EAAE,KAAK,YAAY,KAAG,QAAQ,EA4Y9H,CAAC;AAEF;;;;;;;;GAQG;AACH,QAAA,MAAM,eAAe,GAAI,OAAO,QAAQ,EAAE,EAAE,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,EAAE,SAAS,qBAAqB,EAAE,KAAK,YAAY,KAAG,IA+NnI,CAAC;AAEF,OAAO,EAAE,eAAe,EAAC,qBAAqB,EAAE,CAAC"}
+{"version":3,"file":"edge-generator.d.ts","sourceRoot":"","sources":["../../../src/generation/generators/edge-generator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AA6GzC,OAAO,EAAE,YAAY,EAAE,KAAK,QAAQ,EAAE,KAAK,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGrE;;;;;;;;GAQG;AACH,QAAA,MAAM,qBAAqB,GAAI,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,EAAE,SAAS,qBAAqB,EAAE,KAAK,YAAY,KAAG,QAAQ,EAie9H,CAAC;AAEF;;;;;;;;GAQG;AACH,QAAA,MAAM,eAAe,GAAI,OAAO,QAAQ,EAAE,EAAE,OAAO,QAAQ,EAAE,EAAE,MAAM,SAAS,EAAE,SAAS,qBAAqB,EAAE,KAAK,YAAY,KAAG,IA+NnI,CAAC;AAEF,OAAO,EAAE,eAAe,EAAC,qBAAqB,EAAE,CAAC"}

package/dist/generation/generators/forbidden-subgraph.d.ts

@@ -0,0 +1,83 @@
+import { GraphSpec } from '../spec.js';
+import { SeededRandom, TestEdge, TestNode } from './types.js';
+/**
+ * Generate P5Free edges.
+ * Contains no induced path on 5 vertices
+ * Uses cograph construction (P4-free implies P5-free).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateP5FreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate C5Free edges.
+ * Contains no induced cycle on 5 vertices
+ * Uses chordal graph construction (no induced cycles >= 4).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateC5FreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate BullFree edges.
+ * Contains no induced bull graph
+ * Uses split graph construction (clique + independent set).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateBullFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate GemFree edges.
+ * Contains no induced gem graph
+ * Gem is a P4 with a chord, so generate chordal graph avoiding gem.
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateGemFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate ATFree edges.
+ * No asteroidal triple of vertices
+ * Uses caterpillar tree construction.
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateATFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate HHFree edges.
+ * No induced house or hole
+ * Uses chordal graph construction (which is HH-free).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateHHFreeEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate DistanceHereditary edges.
+ * Distances preserved in all connected induced subgraphs
+ * Uses tree construction (trees are distance-hereditary).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateDistanceHereditaryEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+/**
+ * Generate WeaklyChordal edges.
+ * No induced hole or anti-hole of length >= 5
+ * Uses split graph construction (which is weakly chordal).
+ * @param nodes
+ * @param edges
+ * @param spec
+ * @param rng
+ */
+export declare const generateWeaklyChordalEdges: (nodes: TestNode[], edges: TestEdge[], spec: GraphSpec, rng: SeededRandom) => void;
+//# sourceMappingURL=forbidden-subgraph.d.ts.map