graphbox 1.2.1 → 1.3.0

package/dist/experiments/evaluation/__tests__/validation/common/path-ranking-helpers.d.ts

@@ -0,0 +1,95 @@
+import { Graph } from '../../../../../algorithms/graph/graph';
+import { PathRankingConfig, RankedPath } from '../../../../../algorithms/pathfinding/path-ranking';
+import { Edge, Node } from '../../../../../algorithms/types/graph';
+import { mannWhitneyUTest } from './statistical-functions';
+/**
+ * Spearman's rank correlation coefficient.
+ *
+ * Measures the monotonic relationship between two rankings.
+ * Returns value in [-1, 1] where:
+ * - 1: perfect positive correlation (rankings identical)
+ * - 0: no correlation
+ * - -1: perfect negative correlation (rankings reversed)
+ *
+ * Uses Pearson correlation on rank values.
+ * @param rankingA - First ranking (array of comparable items or numeric ranks)
+ * @param rankingB - Second ranking (array of comparable items or numeric ranks)
+ */
+export declare const spearmanCorrelation: <T extends string | number>(rankingA: T[], rankingB: T[]) => number;
+/**
+ * Kendall's Tau rank correlation coefficient.
+ *
+ * Measures ordinal association between two rankings based on
+ * concordant and discordant pairs.
+ *
+ * Returns value in [-1, 1] where:
+ * - 1: perfect agreement (all pairs concordant)
+ * - 0: no association
+ * - -1: perfect disagreement (all pairs discordant)
+ * @param rankingA - First ranking (array of comparable items or numeric ranks)
+ * @param rankingB - Second ranking (array of comparable items or numeric ranks)
+ */
+export declare const kendallTau: <T extends string | number>(rankingA: T[], rankingB: T[]) => number;
+/**
+ * Run all path ranking methods on the same graph.
+ *
+ * Executes Path Salience Ranking and all baseline methods,
+ * returning their results in a Map for easy comparison.
+ * @param graph
+ * @param sourceId
+ * @param targetId
+ * @param config
+ */
+export declare const runAllRankings: <N extends Node, E extends Edge>(graph: Graph<N, E>, sourceId: string, targetId: string, config?: Partial<PathRankingConfig<N, E>>) => Promise<Map<string, RankedPath<N, E>[]>>;
+/**
+ * Metrics computed from a set of ranked paths.
+ */
+export interface RankingMetrics {
+    /** Mean geometric mean MI of paths */
+    meanMI: number;
+    /** Standard deviation of MI values */
+    stdMI: number;
+    /** Entropy-based path diversity (0-1, higher = more diverse) */
+    pathDiversity: number;
+    /** Hub avoidance: 1 - (high-degree node frequency) */
+    hubAvoidance: number;
+    /** Proportion of unique nodes in reachable set */
+    nodeCoverage: number;
+    /** Mean score across all paths */
+    meanScore: number;
+    /** Standard deviation of scores */
+    stdScore: number;
+}
+/**
+ * Compute comprehensive metrics for a set of ranked paths.
+ *
+ * @param rankedPaths - Array of ranked paths
+ * @param graph - Optional graph for node coverage calculation
+ * @param hubThreshold - Degree threshold for hub classification (default: 10)
+ * @returns Computed metrics
+ */
+export declare const computeRankingMetrics: <N extends Node, E extends Edge>(rankedPaths: RankedPath<N, E>[], graph?: Graph<N, E>, hubThreshold?: number) => RankingMetrics;
+/**
+ * Compare two sets of ranked paths using statistical tests.
+ * @param rankedPathsA
+ * @param rankedPathsB
+ */
+export declare const compareRankings: <N extends Node, E extends Edge>(rankedPathsA: RankedPath<N, E>[], rankedPathsB: RankedPath<N, E>[]) => {
+    spearman: number;
+    kendall: number;
+    mannWhitney: ReturnType<typeof mannWhitneyUTest>;
+    cohensD: number;
+};
+/**
+ * Generate a canonical signature for a path.
+ * Used for comparing paths across different ranking methods.
+ * @param rankedPath
+ */
+export declare const pathSignature: <N extends Node, E extends Edge>(rankedPath: RankedPath<N, E>) => string;
+/**
+ * Generate all path signatures for a ranked path list.
+ * @param rankedPaths
+ */
+export declare const allPathSignatures: <N extends Node, E extends Edge>(rankedPaths: RankedPath<N, E>[]) => string[];
+export { cohensD, confidenceInterval, jaccardSimilarity, mannWhitneyUTest, pathDiversity } from './statistical-functions';
+//# sourceMappingURL=path-ranking-helpers.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/common/path-ranking-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-ranking-helpers.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/common/path-ranking-helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,KAAK,EAAE,MAAM,uCAAuC,CAAC;AACnE,OAAO,EAAE,KAAK,iBAAiB,EAAC,KAAK,UAAU,EAAa,MAAM,oDAAoD,CAAC;AACvH,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,uCAAuC,CAAC;AAKxE,OAAO,EAAW,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAMpE;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EAC5D,UAAU,CAAC,EAAE,EACb,UAAU,CAAC,EAAE,KACX,MAgEF,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,SAAS,MAAM,GAAG,MAAM,EACnD,UAAU,CAAC,EAAE,EACb,UAAU,CAAC,EAAE,KACX,MA8CF,CAAC;AAMF;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,GAAU,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAClE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAClB,UAAU,MAAM,EAChB,UAAU,MAAM,EAChB,SAAS,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KACvC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAsCzC,CAAC;AAMF;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAC;IAEf,sCAAsC;IACtC,KAAK,EAAE,MAAM,CAAC;IAEd,gEAAgE;IAChE,aAAa,EAAE,MAAM,CAAC;IAEtB,sDAAsD;IACtD,YAAY,EAAE,MAAM,CAAC;IAErB,kDAAkD;IAClD,YAAY,EAAE,MAAM,CAAC;IAErB,kCAAkC;IAClC,SAAS,EAAE,MAAM,CAAC;IAElB,mCAAmC;IACnC,QAAQ,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,qBAAqB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EACnE,aAAa,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAC/B,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,qBAAiB,KACf,cA+EF,CAAC;AAMF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAC7D,cAAc,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAChC,cAAc,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAC9B;IACF,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;IACjD,OAAO,EAAE,MAAM,CAAC;CAoBhB,CAAC;AAMF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,YAAY,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAE5F,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,iBAAiB,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,aAAa,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAG,MAAM,EAEzG,CAAC;AAMF,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC"}

package/dist/experiments/evaluation/__tests__/validation/common/representativeness-helpers.d.ts

@@ -0,0 +1,56 @@
+import { Graph } from '../../../../../algorithms/graph/graph';
+import { Neighbor } from '../../../../../interfaces/graph-expander';
+export interface TestNode {
+    id: string;
+    type: string;
+    [key: string]: unknown;
+}
+export interface TestEdge {
+    id: string;
+    source: string;
+    target: string;
+    type: string;
+    [key: string]: unknown;
+}
+/**
+ * Adapter to use Graph class with expansion algorithms
+ */
+export declare class GraphExpanderAdapter {
+    private readonly graph;
+    private adjacency;
+    private degrees;
+    private nodes;
+    constructor(graph: Graph<TestNode, TestEdge>, directed?: boolean);
+    getNeighbors(nodeId: string): Promise<Neighbor[]>;
+    getDegree(nodeId: string): number;
+    getNode(nodeId: string): Promise<TestNode | null>;
+    addEdge(): void;
+    calculatePriority(nodeId: string, options?: {
+        nodeWeight?: number;
+        epsilon?: number;
+    }): number;
+    getAllDegrees(): Map<string, number>;
+}
+/**
+ * Create a test graph from edge list
+ * @param edges
+ */
+export declare const createGraph: (edges: Array<[string, string]>) => Graph<TestNode, TestEdge>;
+/**
+ * Create a chain graph (linear path)
+ * @param length
+ */
+export declare const createChainGraph: (length: number) => Graph<TestNode, TestEdge>;
+/**
+ * Create a grid graph (rows x cols)
+ * @param rows
+ * @param cols
+ */
+export declare const createGridGraph: (rows: number, cols: number) => Graph<TestNode, TestEdge>;
+/**
+ * Create a hub graph with central hub nodes and leaf nodes
+ * @param numberHubs
+ * @param leavesPerHub
+ */
+export declare const createHubGraph: (numberHubs: number, leavesPerHub: number) => Graph<TestNode, TestEdge>;
+//# sourceMappingURL=representativeness-helpers.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/common/representativeness-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"representativeness-helpers.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/common/representativeness-helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,uCAAuC,CAAC;AAC9D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0CAA0C,CAAC;AAEzE,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,qBAAa,oBAAoB;IAM/B,OAAO,CAAC,QAAQ,CAAC,KAAK;IALvB,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,KAAK,CAA+B;gBAG1B,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACjD,QAAQ,UAAQ;IAwBX,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,QAAQ,GAAG,IAAI,CAAC;IAIvD,OAAO,IAAI,IAAI;IAIf,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,MAAM;IAMlG,aAAa,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;CAGpC;AAED;;;GAGG;AACH,eAAO,MAAM,WAAW,GAAI,OAAO,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAG,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAoBpF,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,gBAAgB,GAAI,QAAQ,MAAM,KAAG,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAMzE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,MAAM,EAAE,MAAM,MAAM,KAAG,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAgBpF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAI,YAAY,MAAM,EAAE,cAAc,MAAM,KAAG,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAkBjG,CAAC"}

package/dist/experiments/evaluation/__tests__/validation/common/statistical-functions.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Statistical Test Utilities
+ *
+ * Collection of statistical functions for hypothesis testing,
+ * effect size calculation, and confidence intervals.
+ */
+/**
+ * Mann-Whitney U test for comparing two independent samples.
+ * Tests whether two populations have the same distribution.
+ *
+ * H0: Both populations have the same distribution
+ * H1: Populations have different distributions
+ *
+ * Returns p-value (smaller = more significant difference)
+ * @param sampleA
+ * @param sampleB
+ */
+export declare const mannWhitneyUTest: (sampleA: number[], sampleB: number[]) => {
+    u: number;
+    pValue: number;
+    significant: boolean;
+};
+/**
+ * Standard normal cumulative distribution function.
+ * @param z
+ */
+export declare const normalCDF: (z: number) => number;
+/**
+ * Calculate Cohen's d effect size.
+ * Measures the standardized difference between two means.
+ *
+ * Interpretation:
+ * - 0.2: Small effect
+ * - 0.5: Medium effect
+ * - 0.8: Large effect
+ * @param sampleA
+ * @param sampleB
+ */
+export declare const cohensD: (sampleA: number[], sampleB: number[]) => number;
+/**
+ * Calculate confidence interval for a mean.
+ * @param values
+ * @param _confidence
+ */
+export declare const confidenceInterval: (values: number[], _confidence?: number) => {
+    lower: number;
+    upper: number;
+};
+/**
+ * Calculate Jaccard similarity between two sets.
+ * @param setA
+ * @param setB
+ */
+export declare const jaccardSimilarity: <T>(setA: Set<T>, setB: Set<T>) => number;
+/**
+ * Calculate path diversity (entropy of path lengths).
+ * @param paths
+ */
+export declare const pathDiversity: (paths: Array<{
+    nodes: string[];
+}>) => number;
+/**
+ * Coverage metric for systematic literature review.
+ * Measures how well the sampled subgraph covers different topical regions.
+ * @param sampledNodes
+ * @param graph
+ * @param graph.getDegree
+ * @param graph.getAllNodeIds
+ */
+export declare const calculateTopicCoverage: (sampledNodes: Set<string>, graph: {
+    getDegree(nodeId: string): number;
+    getAllNodeIds(): string[];
+}) => {
+    coverage: number;
+    avgDegree: number;
+    hubRatio: number;
+};
+//# sourceMappingURL=statistical-functions.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/common/statistical-functions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"statistical-functions.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/common/statistical-functions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,gBAAgB,GAAI,SAAS,MAAM,EAAE,EAAE,SAAS,MAAM,EAAE,KAAG;IACvE,CAAC,EAAE,MAAM,CAAC;IACV,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,OAAO,CAAC;CAgDrB,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,KAAG,MAcrC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,OAAO,GAAI,SAAS,MAAM,EAAE,EAAE,SAAS,MAAM,EAAE,KAAG,MAa9D,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,GAAI,QAAQ,MAAM,EAAE,EAAE,oBAAkB,KAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAYvG,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAAI,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,KAAG,MAIjE,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,KAAK,CAAC;IAAE,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,KAAG,MAsBjE,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,GAAI,cAAc,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO;IAAE,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IAAC,aAAa,IAAI,MAAM,EAAE,CAAA;CAAE,KAAG;IAC3I,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;CAsBjB,CAAC"}

package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.d.ts

@@ -0,0 +1,32 @@
+import { GraphExpander, Neighbor } from '../../../../../interfaces/graph-expander';
+export interface TestNode {
+    id: string;
+    degree?: number;
+}
+/**
+ * Creates a test graph expander from an edge list.
+ * Supports both directed and undirected graphs.
+ */
+export declare class TestGraphExpander implements GraphExpander<TestNode> {
+    private adjacency;
+    private degrees;
+    private nodes;
+    constructor(edges: Array<[string, string]>, directed?: boolean);
+    getNeighbors(nodeId: string): Promise<Neighbor[]>;
+    getDegree(nodeId: string): number;
+    getNode(nodeId: string): Promise<TestNode | null>;
+    addEdge(): void;
+    calculatePriority(nodeId: string, options?: {
+        nodeWeight?: number;
+        epsilon?: number;
+    }): number;
+    getNodeCount(): number;
+    getAllNodeIds(): string[];
+    getAllDegrees(): Map<string, number>;
+}
+/**
+ * Create a test graph from edge list
+ * @param edges
+ */
+export declare const createGraphFromEdges: (edges: Array<[string, string]>) => TestGraphExpander;
+//# sourceMappingURL=test-graph-expander.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-graph-expander.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/common/test-graph-expander.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,0CAA0C,CAAC;AAExF,MAAM,WAAW,QAAQ;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,qBAAa,iBAAkB,YAAW,aAAa,CAAC,QAAQ,CAAC;IAChE,OAAO,CAAC,SAAS,CAAiC;IAClD,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,KAAK,CAA+B;gBAEhC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,QAAQ,UAAQ;IAsCtD,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,QAAQ,GAAG,IAAI,CAAC;IAIvD,OAAO,IAAI,IAAI;IAIf,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,aAAa,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;CAGpC;AAED;;;GAGG;AACH,eAAO,MAAM,oBAAoB,GAAI,OAAO,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAG,iBAAwD,CAAC"}

package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.unit.test.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Contract Tests for TestGraphExpander
+ *
+ * These tests verify that TestGraphExpander correctly implements
+ * the GraphExpander interface contract, with particular focus on:
+ * - Edge array → adjacency list conversion
+ * - Factory functions (star, hub, grid, chain)
+ * - Degree calculation consistency
+ * - Directed vs undirected graph handling
+ *
+ * TestGraphExpander is a simpler adapter used in unit tests,
+ * with direct adjacency list construction rather than lazy loading.
+ */
+export {};
+//# sourceMappingURL=test-graph-expander.unit.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/common/test-graph-expander.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"test-graph-expander.unit.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/common/test-graph-expander.unit.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/comparative-summary.exp.integration.test.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Comparative Summary
+ *
+ * Generates a comparative summary of all three dimensions:
+ * - Novelty: Difference from BFS
+ * - Validity: Thesis compliance
+ * - Value: Practical benefits
+ */
+export {};
+//# sourceMappingURL=comparative-summary.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/comparative-summary.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comparative-summary.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/comparative-summary.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/execution-time.exp.integration.test.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Thesis Validation: Runtime Performance Tests
+ *
+ * Extracted from thesis-validation.integration.test.ts
+ */
+export {};
+//# sourceMappingURL=execution-time.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/execution-time.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"execution-time.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/execution-time.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/literature-review-metrics.exp.integration.test.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Systematic Literature Review Metrics Tests
+ *
+ * Application-specific evaluation metrics for systematic literature review workflows.
+ * Tests hub deferral, recall efficiency, citation coverage, and early discovery rate.
+ *
+ * These metrics are specific to the citation network use case where:
+ * - High-degree nodes represent survey/mega-citation papers
+ * - Hub deferral improves topical diversity
+ * - Early discovery of diverse paths improves review efficiency
+ */
+export {};
+//# sourceMappingURL=literature-review-metrics.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/literature-review-metrics.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"literature-review-metrics.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/literature-review-metrics.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/method-ranking.exp.integration.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Method Ranking Tests
+ *
+ * Compares all expansion methods by path diversity to validate
+ * the thesis method's effectiveness against multiple baselines.
+ */
+export {};
+//# sourceMappingURL=method-ranking.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/method-ranking.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"method-ranking.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/method-ranking.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/multi-method-comparison.exp.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Multi-Method Comparison with Significance Testing
+ *
+ * Compares all four expansion methods (Degree-Prioritised, BFS, Frontier-Balanced, Random)
+ * with proper statistical testing including Mann-Whitney U tests, Cohen's d effect sizes,
+ * and confidence intervals.
+ */
+export {};
+//# sourceMappingURL=multi-method-comparison.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/multi-method-comparison.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multi-method-comparison.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/multi-method-comparison.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/novel-algorithm-comparison.exp.integration.test.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Novel Algorithm Statistical Comparison Tests
+ *
+ * Compares novel expansion algorithms (EGE, PPME, RSGE) against the
+ * DegreePrioritised baseline using statistical significance tests
+ * (Mann-Whitney U) and effect sizes (Cohen's d).
+ *
+ * Tests use multiple benchmark datasets (karate, lesmis, cora) with
+ * multiple trials per configuration for statistical power.
+ */
+export {};
+//# sourceMappingURL=novel-algorithm-comparison.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/novel-algorithm-comparison.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"novel-algorithm-comparison.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/novel-algorithm-comparison.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/perturbation-consistency.exp.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Perturbed Graph Robustness Tests
+ *
+ * Tests the robustness of graph expansion algorithms under graph perturbations
+ * including edge removal and random edge addition. Validates consistent method
+ * ranking across perturbed versions.
+ */
+export {};
+//# sourceMappingURL=perturbation-consistency.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/perturbation-consistency.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"perturbation-consistency.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/perturbation-consistency.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/validation-summary.exp.integration.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Thesis Validation: Summary and Additional Metrics Tests
+ *
+ * Comprehensive summary combining all validation dimensions,
+ * plus extended metrics for path length, coverage efficiency,
+ * and hub participation analysis.
+ */
+export {};
+//# sourceMappingURL=validation-summary.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/validation-summary.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation-summary.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/validation-summary.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/experiments/evaluation/__tests__/validation/comparative/variability-injection.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=variability-injection.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/comparative/variability-injection.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"variability-injection.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../src/experiments/evaluation/__tests__/validation/comparative/variability-injection.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/graph-adapters.property.unit.test.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Property-Based Tests for Graph Adapters
+ *
+ * Uses fast-check to verify graph adapter invariants hold across
+ * randomized graph structures. Tests fundamental graph properties
+ * that must hold regardless of implementation:
+ *
+ * - Degree consistency: getDegree() matches neighbor count
+ * - Undirected symmetry: if A → B then B → A
+ * - Directed asymmetry: A → B doesn't imply B → A
+ * - Degree sum: sum of degrees = 2 * edges (undirected) or edges (directed)
+ * - Node preservation: all nodes in edges appear in node list
+ */
+export {};
+//# sourceMappingURL=graph-adapters.property.unit.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/graph-adapters.property.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adapters.property.unit.test.d.ts","sourceRoot":"","sources":["../../../../../src/experiments/evaluation/__tests__/validation/graph-adapters.property.unit.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG"}

package/dist/experiments/evaluation/__tests__/validation/primary/classification/classification-evaluation.exp.integration.test.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Classification Evaluation Experiment
+ *
+ * Runs the full classification evaluation pipeline across four graph
+ * structural classes (Erdos-Renyi, Barabasi-Albert, Watts-Strogatz,
+ * Real-World) and outputs structured console metrics for the TAP runner.
+ *
+ * Metrics:
+ * - Per-class precision, recall, F1, and support
+ * - Accuracy vs random baseline (25% for 4 classes)
+ * - Macro F1 assertion (> 0.5)
+ */
+export {};
+//# sourceMappingURL=classification-evaluation.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/classification/classification-evaluation.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classification-evaluation.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../src/experiments/evaluation/__tests__/validation/primary/classification/classification-evaluation.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG"}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/cora.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=cora.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/cora.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cora.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/cora.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/facebook.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=facebook.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/facebook.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"facebook.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/facebook.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/karate-club.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=karate-club.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/karate-club.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"karate-club.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/karate-club.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/les-mis.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=les-mis.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/les-mis.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"les-mis.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/benchmarks/les-mis.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/comparative/method-comparison.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=method-comparison.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/comparative/method-comparison.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"method-comparison.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/comparative/method-comparison.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/correctness/modularity-quality.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=modularity-quality.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/correctness/modularity-quality.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularity-quality.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/community-detection/louvain/correctness/modularity-quality.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/cora.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=cora.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/cora.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cora.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/cora.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/facebook.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=facebook.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/facebook.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"facebook.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/facebook.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/karate-club.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=karate-club.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/karate-club.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"karate-club.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/karate-club.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/les-mis.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=les-mis.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/les-mis.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"les-mis.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/benchmarks/les-mis.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/comparative/core-periphery-analysis.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=core-periphery-analysis.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/comparative/core-periphery-analysis.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"core-periphery-analysis.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/comparative/core-periphery-analysis.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/correctness/nested-hierarchy.exp.integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=nested-hierarchy.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/correctness/nested-hierarchy.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nested-hierarchy.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/decomposition/k-core/correctness/nested-hierarchy.exp.integration.test.ts"],"names":[],"mappings":""}

package/dist/experiments/evaluation/__tests__/validation/primary/generation/generation-evaluation.exp.integration.test.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Generation Evaluation Experiment
+ *
+ * Runs the full generation evaluation pipeline, measuring how well
+ * feature-constrained graph generation produces graphs that are
+ * correctly classified by the trained classifier.
+ *
+ * Metrics:
+ * - Per-class acceptance rate and mean confidence
+ * - Overall acceptance rate vs 33% random baseline (3 synthetic classes)
+ * - Overall acceptance rate assertion (> 0.5)
+ */
+export {};
+//# sourceMappingURL=generation-evaluation.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/generation/generation-evaluation.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generation-evaluation.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../src/experiments/evaluation/__tests__/validation/primary/generation/generation-evaluation.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG"}

package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/citeseer.exp.integration.test.d.ts

@@ -0,0 +1,16 @@
+/**
+ * CiteSeer Benchmark Tests for Path Salience Ranking
+ *
+ * Tests the Path Salience Ranking algorithm on the CiteSeer citation network,
+ * a scientific paper citation graph with 3312 nodes (papers) and 4536 edges.
+ *
+ * The network represents papers in computer science research, with edges
+ * indicating citation relationships.
+ *
+ * Tests validate:
+ * - Path ranking performance on larger citation networks
+ * - Academic paper connectivity analysis
+ * - Statistical comparison against baseline methods
+ */
+export {};
+//# sourceMappingURL=citeseer.exp.integration.test.d.ts.map

package/dist/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/citeseer.exp.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"citeseer.exp.integration.test.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/experiments/evaluation/__tests__/validation/primary/ranking/path-salience/benchmarks/citeseer.exp.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG"}