graphbox 1.2.1 → 1.3.0

package/dist/suts/multi-frontier-adaptive-v1.0.0.d.ts

@@ -0,0 +1,56 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { DegreePrioritisedExpansionResult } from '../algorithms/traversal/degree-prioritised-expansion.js';
+import { GraphExpander } from '../interfaces/graph-expander.js';
+/**
+ * Traversal inputs for this SUT.
+ */
+export interface TraversalInputs<T = unknown> {
+    /** Graph expander providing neighbour access */
+    expander: GraphExpander<T>;
+    /** Array of seed node IDs */
+    seeds: readonly string[];
+}
+/**
+ * Traversal result with standard metrics.
+ */
+export interface TraversalResult {
+    /** Number of paths discovered */
+    pathsFound: number;
+    /** Total nodes sampled */
+    nodesExpanded: number;
+    /** Total edges traversed */
+    edgesTraversed: number;
+    /** Number of iterations */
+    iterations: number;
+    /** Path diversity (unique nodes / total path nodes) */
+    pathDiversity: number;
+    /** Hub avoidance ratio */
+    hubAvoidance: number;
+    /** Mean path salience (estimated) */
+    meanPathSalience: number;
+    /** Nodes per salient path (efficiency metric) */
+    nodesPerSalientPath: number;
+    /** Final phase reached (1, 2, or 3) */
+    finalPhase: number;
+    /** Discovered paths */
+    paths: Array<{
+        fromSeed: number;
+        toSeed: number;
+        nodes: string[];
+        salience?: number;
+    }>;
+    /** Raw expansion result */
+    rawResult: DegreePrioritisedExpansionResult;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Multi-Frontier Adaptive Expansion SUT instance.
+ *
+ * @param config - Optional configuration overrides
+ * @returns PPEF-compatible SUT object
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<TraversalInputs, TraversalResult>;
+//# sourceMappingURL=multi-frontier-adaptive-v1.0.0.d.ts.map

package/dist/suts/multi-frontier-adaptive-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multi-frontier-adaptive-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/multi-frontier-adaptive-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,KAAK,EAAE,gCAAgC,EAAE,MAAM,yDAAyD,CAAC;AAEhH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAErE;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,GAAG,OAAO;IAC3C,gDAAgD;IAChD,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,6BAA6B;IAC7B,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,aAAa,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,qCAAqC;IACrC,gBAAgB,EAAE,MAAM,CAAC;IACzB,iDAAiD;IACjD,mBAAmB,EAAE,MAAM,CAAC;IAC5B,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,uBAAuB;IACvB,KAAK,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvF,2BAA2B;IAC3B,SAAS,EAAE,gCAAgC,CAAC;CAC5C;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAc1B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,eAAe,EAAE,eAAe,CAsChG,CAAC"}

package/dist/suts/path-preserving-v1.0.0.d.ts

@@ -0,0 +1,58 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { DegreePrioritisedExpansionResult } from '../algorithms/traversal/degree-prioritised-expansion.js';
+import { GraphExpander } from '../interfaces/graph-expander.js';
+/**
+ * Configuration for Path-Preserving Expansion SUT.
+ */
+export interface PathPreservingConfig {
+    /** Target paths per seed pair for early termination (optional) */
+    targetPathsPerPair?: number;
+}
+/**
+ * Traversal inputs for this SUT.
+ */
+export interface TraversalInputs<T = unknown> {
+    /** Graph expander providing neighbour access */
+    expander: GraphExpander<T>;
+    /** Array of seed node IDs */
+    seeds: readonly string[];
+}
+/**
+ * Traversal result with standard metrics.
+ */
+export interface TraversalResult {
+    /** Number of paths discovered */
+    pathsFound: number;
+    /** Total nodes sampled */
+    nodesExpanded: number;
+    /** Total edges traversed */
+    edgesTraversed: number;
+    /** Number of iterations */
+    iterations: number;
+    /** Path diversity (unique nodes / total path nodes) */
+    pathDiversity: number;
+    /** Hub avoidance ratio */
+    hubAvoidance: number;
+    /** Frontier divergence score (higher = more frontier separation) */
+    frontierDivergence: number;
+    /** Discovered paths */
+    paths: Array<{
+        fromSeed: number;
+        toSeed: number;
+        nodes: string[];
+    }>;
+    /** Raw expansion result */
+    rawResult: DegreePrioritisedExpansionResult;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Path-Preserving Expansion SUT instance.
+ *
+ * @param config - Optional configuration overrides
+ * @returns PPEF-compatible SUT object
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<TraversalInputs, TraversalResult>;
+//# sourceMappingURL=path-preserving-v1.0.0.d.ts.map

package/dist/suts/path-preserving-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-preserving-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/path-preserving-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,KAAK,EAAE,gCAAgC,EAAE,MAAM,yDAAyD,CAAC;AAEhH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAErE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACpC,kEAAkE;IAClE,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,GAAG,OAAO;IAC3C,gDAAgD;IAChD,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,6BAA6B;IAC7B,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,aAAa,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,uBAAuB;IACvB,KAAK,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACpE,2BAA2B;IAC3B,SAAS,EAAE,gCAAgC,CAAC;CAC5C;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,eAAe,EAAE,eAAe,CAiChG,CAAC"}

package/dist/suts/path-salience-v1.0.0.d.ts

@@ -0,0 +1,57 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { BenchmarkGraphExpander } from '../experiments/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;
+}
+/**
+ * Ranking inputs for this SUT.
+ */
+export interface RankingInputs {
+    /** Graph expander for path discovery */
+    input: BenchmarkGraphExpander;
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    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;
+    }>;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Path Salience SUT instance.
+ *
+ * Factory function for PPEF worker thread execution.
+ * Returns a PPEF-compatible SUT object with run() method.
+ *
+ * @param config - Optional configuration overrides
+ * @returns PPEF-compatible SUT object
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<RankingInputs, PathSalienceResult>;
+//# sourceMappingURL=path-salience-v1.0.0.d.ts.map

package/dist/suts/path-salience-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-salience-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/path-salience-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAG,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAK5D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,mFAAmF,CAAC;AAGhI;;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,aAAa;IAC7B,wCAAwC;IACxC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB;IACrB,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;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAQF;;;;;;;;GAQG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,aAAa,EAAE,kBAAkB,CAiEjG,CAAC"}

package/dist/suts/random-ranking-v1.0.0.d.ts

@@ -0,0 +1,50 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { BenchmarkGraphExpander } from '../experiments/evaluation/__tests__/validation/common/benchmark-graph-expander.js';
+/**
+ * Configuration for Random Ranking SUT.
+ */
+export interface RandomRankingConfig {
+    /** Maximum number of paths to return */
+    maxPaths?: number;
+    /** Random seed for reproducibility */
+    seed?: number;
+}
+/**
+ * Ranking inputs for this SUT.
+ */
+export interface RankingInputs {
+    /** Graph expander for path discovery */
+    input: BenchmarkGraphExpander;
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    target: string;
+}
+/**
+ * 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;
+    }>;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Random Ranking SUT instance.
+ * @param config
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<RankingInputs, RandomRankingResult>;
+//# sourceMappingURL=random-ranking-v1.0.0.d.ts.map

package/dist/suts/random-ranking-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-ranking-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/random-ranking-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAG,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAK5D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,mFAAmF,CAAC;AAGhI;;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,aAAa;IAC7B,wCAAwC;IACxC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;CACf;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;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAOF;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,aAAa,EAAE,mBAAmB,CAuDlG,CAAC"}

package/dist/suts/retrospective-salience-v1.0.0.d.ts

@@ -0,0 +1,57 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { DegreePrioritisedExpansionResult } from '../algorithms/traversal/degree-prioritised-expansion.js';
+import { GraphExpander } from '../interfaces/graph-expander.js';
+/**
+ * Configuration for Retrospective Salience Expansion SUT.
+ */
+export type RetrospectiveSalienceConfig = Record<string, never>;
+/**
+ * Traversal inputs for this SUT.
+ */
+export interface TraversalInputs<T = unknown> {
+    /** Graph expander providing neighbour access */
+    expander: GraphExpander<T>;
+    /** Array of seed node IDs */
+    seeds: readonly string[];
+}
+/**
+ * Traversal result with standard metrics.
+ */
+export interface TraversalResult {
+    /** Number of paths discovered */
+    pathsFound: number;
+    /** Total nodes sampled */
+    nodesExpanded: number;
+    /** Total edges traversed */
+    edgesTraversed: number;
+    /** Number of iterations */
+    iterations: number;
+    /** Path diversity (unique nodes / total path nodes) */
+    pathDiversity: number;
+    /** Hub avoidance ratio */
+    hubAvoidance: number;
+    /** Mean estimated MI across discovered path nodes */
+    meanPathMI: number;
+    /** Iteration when salience phase activated (0 if never) */
+    saliencePhaseIteration: number;
+    /** Discovered paths */
+    paths: Array<{
+        fromSeed: number;
+        toSeed: number;
+        nodes: string[];
+    }>;
+    /** Raw expansion result */
+    rawResult: DegreePrioritisedExpansionResult;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Retrospective Salience Expansion SUT instance.
+ *
+ * @param config - Optional configuration overrides
+ * @returns PPEF-compatible SUT object
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<TraversalInputs, TraversalResult>;
+//# sourceMappingURL=retrospective-salience-v1.0.0.d.ts.map

package/dist/suts/retrospective-salience-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrospective-salience-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/retrospective-salience-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,KAAK,EAAE,gCAAgC,EAAE,MAAM,yDAAyD,CAAC;AAEhH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAErE;;GAEG;AACH,MAAM,MAAM,2BAA2B,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,GAAG,OAAO;IAC3C,gDAAgD;IAChD,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,6BAA6B;IAC7B,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,aAAa,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,qDAAqD;IACrD,UAAU,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,sBAAsB,EAAE,MAAM,CAAC;IAC/B,uBAAuB;IACvB,KAAK,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACpE,2BAA2B;IAC3B,SAAS,EAAE,gCAAgC,CAAC;CAC5C;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,eAAe,EAAE,eAAe,CA+BhG,CAAC"}

package/dist/suts/shortest-ranking-v1.0.0.d.ts

@@ -0,0 +1,49 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { BenchmarkGraphExpander } from '../experiments/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;
+}
+/**
+ * Ranking inputs for this SUT.
+ */
+export interface RankingInputs {
+    /** Graph expander for path discovery */
+    input: BenchmarkGraphExpander;
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    target: string;
+}
+/**
+ * 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;
+    }>;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Shortest Ranking SUT instance.
+ * @param config
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<RankingInputs, ShortestRankingResult>;
+//# sourceMappingURL=shortest-ranking-v1.0.0.d.ts.map

package/dist/suts/shortest-ranking-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-ranking-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/shortest-ranking-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAG,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAK5D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,mFAAmF,CAAC;AAGhI;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACrC,wCAAwC;IACxC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B,wCAAwC;IACxC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;CACf;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;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAOF;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,aAAa,EAAE,qBAAqB,CA0DpG,CAAC"}

package/dist/suts/standard-bfs-v1.0.0.d.ts

@@ -0,0 +1,53 @@
+import { SUT, SutRegistration } from 'ppef/types/sut';
+import { StandardBfsResult } from '../experiments/baselines/standard-bfs.js';
+import { GraphExpander } from '../interfaces/graph-expander.js';
+/**
+ * Configuration for Standard BFS Expansion SUT.
+ */
+export type StandardBfsConfig = Record<string, never>;
+/**
+ * Traversal inputs for this SUT.
+ */
+export interface TraversalInputs<T = unknown> {
+    /** Graph expander providing neighbour access */
+    expander: GraphExpander<T>;
+    /** Array of seed node IDs */
+    seeds: readonly string[];
+}
+/**
+ * Traversal result with standard metrics.
+ */
+export interface TraversalResult {
+    /** Number of paths discovered */
+    pathsFound: number;
+    /** Total nodes sampled */
+    nodesExpanded: number;
+    /** Total edges traversed */
+    edgesTraversed: number;
+    /** Number of iterations */
+    iterations: number;
+    /** Path diversity (unique nodes / total path nodes) */
+    pathDiversity: number;
+    /** Hub avoidance ratio */
+    hubAvoidance: number;
+    /** Discovered paths */
+    paths: Array<{
+        fromSeed: number;
+        toSeed: number;
+        nodes: string[];
+    }>;
+    /** Raw expansion result */
+    rawResult: StandardBfsResult;
+}
+/**
+ * SUT registration metadata.
+ */
+export declare const registration: SutRegistration;
+/**
+ * Create a Standard BFS Expansion SUT instance.
+ *
+ * @param config - Optional configuration overrides
+ * @returns PPEF-compatible SUT object
+ */
+export declare const createSut: (config?: Record<string, unknown>) => SUT<TraversalInputs, TraversalResult>;
+//# sourceMappingURL=standard-bfs-v1.0.0.d.ts.map

package/dist/suts/standard-bfs-v1.0.0.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard-bfs-v1.0.0.d.ts","sourceRoot":"","sources":["../../src/suts/standard-bfs-v1.0.0.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,EAAwB,KAAK,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AACxG,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAErE;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,GAAG,OAAO;IAC3C,gDAAgD;IAChD,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC3B,6BAA6B;IAC7B,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,4BAA4B;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,aAAa,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,uBAAuB;IACvB,KAAK,EAAE,KAAK,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACpE,2BAA2B;IAC3B,SAAS,EAAE,iBAAiB,CAAC;CAC7B;AAED;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,eAQ1B,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,eAAe,EAAE,eAAe,CA+BhG,CAAC"}

package/dist/types/graph-core.d.ts

@@ -0,0 +1,176 @@
+import { GraphSpec } from '../generation/spec.js';
+/**
+ * Represents a node in a graph with extensible attributes.
+ *
+ * @property id - Unique identifier for the node
+ * @property label - Optional human-readable label
+ * @property type - Optional node type for heterogeneous graphs
+ * @property partition - Optional partition label for bipartite graphs ("left" or "right")
+ *
+ * Additional custom attributes can be added via index signature.
+ */
+export interface GraphNode {
+    /** Unique identifier for the node */
+    id: string;
+    /** Optional human-readable label */
+    label?: string;
+    /** Optional node type for heterogeneous graphs */
+    type?: string;
+    /** Optional partition label for bipartite graphs */
+    partition?: "left" | "right";
+    /** Extensible attributes for custom node properties */
+    [key: string]: unknown;
+}
+/**
+ * Represents an edge in a graph with extensible attributes.
+ *
+ * @property source - ID of the source node
+ * @property target - ID of the target node
+ * @property directed - Optional per-edge directionality override
+ * @property weight - Optional edge weight (numeric)
+ * @property type - Optional edge type for heterogeneous graphs
+ *
+ * Additional custom attributes can be added via index signature.
+ */
+export interface GraphEdge {
+    /** ID of the source node */
+    source: string;
+    /** ID of the target node */
+    target: string;
+    /** Optional per-edge directionality override */
+    directed?: boolean;
+    /** Optional edge weight */
+    weight?: number;
+    /** Optional edge type for heterogeneous graphs */
+    type?: string;
+    /** Extensible attributes for custom edge properties */
+    [key: string]: unknown;
+}
+/**
+ * Core graph structure representing a collection of nodes and edges.
+ *
+ * This is the fundamental graph representation used throughout GraphBox.
+ * It supports both directed and undirected graphs, with optional per-edge
+ * directionality overrides.
+ *
+ * @property nodes - Array of graph nodes
+ * @property edges - Array of graph edges
+ * @property directed - Default directionality for edges (true = directed, false = undirected)
+ *
+ * @example
+ * ```typescript
+ * const graph: CoreGraph = {
+ *   nodes: [
+ *     { id: "A", label: "Node A" },
+ *     { id: "B", label: "Node B" }
+ *   ],
+ *   edges: [
+ *     { source: "A", target: "B", weight: 1.0 }
+ *   ],
+ *   directed: false
+ * };
+ * ```
+ */
+export interface CoreGraph {
+    /** Array of graph nodes */
+    nodes: GraphNode[];
+    /** Array of graph edges */
+    edges: GraphEdge[];
+    /** Default directionality (true = directed, false = undirected) */
+    directed?: boolean;
+}
+/**
+ * Graph with an associated specification for validation and generation.
+ *
+ * Used primarily in graph generation and validation workflows where
+ * the graph must conform to a specific specification.
+ *
+ * @augments CoreGraph
+ * @property spec - Graph specification defining structural constraints
+ *
+ * @example
+ * ```typescript
+ * const specGraph: SpecifiedGraph = {
+ *   nodes: [...],
+ *   edges: [...],
+ *   directed: true,
+ *   spec: {
+ *     directionality: { kind: "directed" },
+ *     connectivity: { kind: "connected" }
+ *   }
+ * };
+ * ```
+ */
+export interface SpecifiedGraph extends CoreGraph {
+    /** Graph specification defining structural constraints */
+    spec: GraphSpec;
+}
+/**
+ * Metadata for documented graphs (file I/O).
+ *
+ * Contains information about the graph source, creation date,
+ * and optional descriptive metadata.
+ */
+export interface GraphMeta {
+    /** Graph title or name */
+    title?: string;
+    /** Graph description */
+    description?: string;
+    /** Creator or author */
+    creator?: string;
+    /** Creation or modification date */
+    date?: string;
+    /** Source URL or reference */
+    source?: string;
+    /** Additional metadata fields */
+    [key: string]: unknown;
+}
+/**
+ * Graph with associated metadata for documentation and file I/O.
+ *
+ * Used primarily in file format parsers and serializers to preserve
+ * metadata when reading/writing graph files.
+ *
+ * @augments CoreGraph
+ * @property meta - Metadata describing the graph
+ *
+ * @example
+ * ```typescript
+ * const docGraph: DocumentedGraph = {
+ *   nodes: [...],
+ *   edges: [...],
+ *   directed: false,
+ *   meta: {
+ *     title: "Zachary's Karate Club",
+ *     source: "http://networkrepository.com",
+ *     date: "2024-01-01"
+ *   }
+ * };
+ * ```
+ */
+export interface DocumentedGraph extends CoreGraph {
+    /** Metadata describing the graph */
+    meta: GraphMeta;
+}
+/**
+ * Type guard to check if a value is a CoreGraph.
+ *
+ * @param value - Value to check
+ * @returns True if value is a CoreGraph
+ */
+export declare const isCoreGraph: (value?: unknown) => value is CoreGraph;
+/**
+ * Type guard to check if a value is a SpecifiedGraph.
+ *
+ * @param value - Value to check
+ * @returns True if value is a SpecifiedGraph
+ */
+export declare const isSpecifiedGraph: (value: unknown) => value is SpecifiedGraph;
+/**
+ * Type guard to check if a value is a DocumentedGraph.
+ *
+ * @param value - Value to check
+ * @returns True if value is a DocumentedGraph
+ */
+export declare const isDocumentedGraph: (value: unknown) => value is DocumentedGraph;
+//# sourceMappingURL=graph-core.d.ts.map

package/dist/types/graph-core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-core.d.ts","sourceRoot":"","sources":["../../src/types/graph-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAEvD;;;;;;;;;GASG;AACH,MAAM,WAAW,SAAS;IACzB,qCAAqC;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,oCAAoC;IACpC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,kDAAkD;IAClD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC7B,uDAAuD;IACvD,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,SAAS;IACzB,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,gDAAgD;IAChD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,2BAA2B;IAC3B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,kDAAkD;IAClD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,uDAAuD;IACvD,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,WAAW,SAAS;IACzB,2BAA2B;IAC3B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,2BAA2B;IAC3B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,mEAAmE;IACnE,QAAQ,CAAC,EAAE,OAAO,CAAC;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,WAAW,cAAe,SAAQ,SAAS;IAChD,0DAA0D;IAC1D,IAAI,EAAE,SAAS,CAAC;CAChB;AAED;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACzB,0BAA0B;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,wBAAwB;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wBAAwB;IACxB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,oCAAoC;IACpC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8BAA8B;IAC9B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,iCAAiC;IACjC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,WAAW,eAAgB,SAAQ,SAAS;IACjD,oCAAoC;IACpC,IAAI,EAAE,SAAS,CAAC;CAChB;AAED;;;;;GAKG;AACH,eAAO,MAAM,WAAW,GAAI,QAAO,OAAmB,KAAG,KAAK,IAAI,SAYjE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,cAO1D,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,eAO3D,CAAC"}

package/dist/types/graph-core.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for core graph types and type guards
+ */
+export {};
+//# sourceMappingURL=graph-core.unit.test.d.ts.map

package/dist/types/graph-core.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-core.unit.test.d.ts","sourceRoot":"","sources":["../../src/types/graph-core.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}