graphbox 1.2.2 → 1.3.0

package/dist/algorithms/traversal/priority-calculator.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Priority Calculation for Thesis-Aligned Degree-Prioritised Expansion
+ *
+ * Implements the priority function from Equation 4.106:
+ * $$\pi(v) = \frac{\deg^{+}(v) + \deg^{-}(v)}{w_V(v) + \epsilon}$$
+ *
+ * @module traversal/priority-calculator
+ */
+/**
+ * Default epsilon value for division-by-zero prevention.
+ */
+export declare const DEFAULT_EPSILON = 1e-10;
+/**
+ * Default node weight (unweighted nodes).
+ */
+export declare const DEFAULT_NODE_WEIGHT = 1;
+/**
+ * Options for weighted priority calculation.
+ */
+export interface PriorityOptions {
+    /**
+     * Node weight for normalization (w_V(v) in thesis formula).
+     * Higher values decrease priority (node is considered more important/central).
+     * Default: 1 (unweighted nodes).
+     */
+    nodeWeight?: number;
+    /**
+     * Small constant to prevent division by zero.
+     * Default: 1e-10.
+     */
+    epsilon?: number;
+    /**
+     * Whether to use simple degree count (legacy behavior) or weighted formula.
+     * Default: false (use weighted formula).
+     */
+    useSimpleDegree?: boolean;
+}
+/**
+ * Calculate thesis-aligned priority for a node.
+ *
+ * Priority determines visitation order: lower priority = visited earlier.
+ * This implements Equation 4.106 from the thesis.
+ *
+ * @param outDegree - Weighted out-degree (sum of outgoing edge weights)
+ * @param inDegree - Weighted in-degree (sum of incoming edge weights)
+ * @param options - Configuration options
+ * @returns Priority value (lower = higher priority)
+ *
+ * @example
+ * ```typescript
+ * // Unweighted node with 10 total connections
+ * const priority = calculatePriority(5, 5, {});
+ * // Returns: (5 + 5) / (1 + 1e-10) ≈ 10
+ *
+ * // Weighted node with high importance (weight = 5)
+ * const priority = calculatePriority(50, 50, { nodeWeight: 5 });
+ * // Returns: (50 + 50) / (5 + 1e-10) ≈ 20
+ *
+ * // Low-degree peripheral node
+ * const priority = calculatePriority(2, 1, {});
+ * // Returns: (2 + 1) / (1 + 1e-10) ≈ 3
+ * ```
+ */
+export declare const calculatePriority: (outDegree: number, inDegree: number, options?: PriorityOptions) => number;
+/**
+ * Calculate thesis-aligned priority from neighbor lists.
+ *
+ * This helper function calculates priority when you have arrays of
+ * incoming and outgoing neighbors with their weights.
+ *
+ * @param outNeighbors - Array of (targetId, weight) tuples for outgoing edges
+ * @param inNeighbors - Array of (sourceId, weight) tuples for incoming edges
+ * @param options - Configuration options
+ * @returns Priority value (lower = higher priority)
+ *
+ * @example
+ * ```typescript
+ * const outNeighbors = [
+ *   { targetId: 'B', weight: 1 },
+ *   { targetId: 'C', weight: 2 },
+ * ];
+ * const inNeighbors = [
+ *   { sourceId: 'A', weight: 1 },
+ *   { sourceId: 'D', weight: 3 },
+ * ];
+ * const priority = calculatePriorityFromNeighbors(outNeighbors, inNeighbors);
+ * // Returns: (1 + 2 + 1 + 3) / 1 = 7
+ * ```
+ */
+export declare const calculatePriorityFromNeighbors: (outNeighbors: Array<{
+    targetId: string;
+    weight?: number;
+}>, inNeighbors: Array<{
+    sourceId: string;
+    weight?: number;
+}>, options?: PriorityOptions) => number;
+/**
+ * Create a priority calculator bound to specific options.
+ *
+ * Useful for creating multiple calculators with different configurations.
+ *
+ * @param options - Configuration options (will be merged with defaults)
+ * @returns Function that calculates priority given out/in degrees
+ *
+ * @example
+ * ```typescript
+ * // Calculator for importance-weighted nodes
+ * const weightedCalculator = createPriorityCalculator({ nodeWeight: 5 });
+ * const priority = weightedCalculator(10, 20);
+ * // Returns: (10 + 20) / (5 + 1e-10) ≈ 6
+ *
+ * // Calculator for unweighted nodes
+ * const simpleCalculator = createPriorityCalculator({});
+ * const priority = simpleCalculator(10, 20);
+ * // Returns: (10 + 20) / (1 + 1e-10) ≈ 30
+ * ```
+ */
+export declare const createPriorityCalculator: (options?: PriorityOptions) => (outDegree: number, inDegree: number) => number;
+/**
+ * Calculate priority using simple degree count (legacy behavior).
+ *
+ * This is provided for backward compatibility with implementations
+ * that use raw degree counts without weighting.
+ *
+ * @param totalDegree - Total degree (in + out, unweighted)
+ * @returns The same degree value (identity function)
+ *
+ * @example
+ * ```typescript
+ * const priority = legacyCalculatePriority(42);
+ * // Returns: 42
+ * ```
+ */
+export declare const legacyCalculatePriority: (totalDegree: number) => number;
+//# sourceMappingURL=priority-calculator.d.ts.map

package/dist/algorithms/traversal/priority-calculator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-calculator.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/priority-calculator.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,eAAO,MAAM,eAAe,QAAQ,CAAC;AAErC;;GAEG;AACH,eAAO,MAAM,mBAAmB,IAAI,CAAC;AAErC;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,iBAAiB,GAAI,WAAW,MAAM,EAAE,UAAU,MAAM,EAAE,UAAS,eAAoB,KAAG,MAiBtG,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,8BAA8B,GAAI,cAAc,KAAK,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,EAAE,aAAa,KAAK,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,EAAE,UAAS,eAAoB,KAAG,MAKrM,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,eAAO,MAAM,wBAAwB,GAAI,UAAS,eAAoB,KAAG,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,MAUjH,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,uBAAuB,GAAI,aAAa,MAAM,KAAG,MAAqB,CAAC"}

package/dist/algorithms/traversal/priority-queue.d.ts

@@ -43,6 +43,12 @@ export declare class PriorityQueue<T> {
      * Get the number of items in the queue.
      */
     get length(): number;
+    /**
+     * Peek at the priority of the minimum item without removing it.
+     *
+     * @returns Priority of the item with minimum priority, or Infinity if queue is empty
+     */
+    peekPriority(): number;
     /**
      * Check if an item is in the queue.
      *

package/dist/algorithms/traversal/priority-queue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"priority-queue.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAA4C;IACxD,OAAO,CAAC,OAAO,CAAgB;IAE/B;;;;;;OAMG;IACH,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAQrC;;;;OAIG;IACH,GAAG,IAAI,CAAC,GAAG,SAAS;IAsBpB;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO;IAI1B;;;OAGG;IACF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIjC;;;;OAIG;IACH,OAAO,CAAC,QAAQ;IAShB;;;;OAIG;IACH,OAAO,CAAC,UAAU;CAkBlB"}
+{"version":3,"file":"priority-queue.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/priority-queue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAA4C;IACxD,OAAO,CAAC,OAAO,CAAgB;IAE/B;;;;;;OAMG;IACH,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAQrC;;;;OAIG;IACH,GAAG,IAAI,CAAC,GAAG,SAAS;IAsBpB;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;;;OAIG;IACH,YAAY,IAAI,MAAM;IAItB;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO;IAI1B;;;OAGG;IACF,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIjC;;;;OAIG;IACH,OAAO,CAAC,QAAQ;IAShB;;;;OAIG;IACH,OAAO,CAAC,UAAU;CAkBlB"}

package/dist/algorithms/traversal/retrospective-salience-expansion.d.ts

@@ -0,0 +1,173 @@
+import { GraphExpander } from '../../interfaces/graph-expander.js';
+import { DegreePrioritisedExpansionResult } from './degree-prioritised-expansion.js';
+/**
+ * Retrospective Salience-Guided Expansion (RSGE)
+ *
+ * **Novel Contribution**: Self-correcting two-phase expansion that starts with
+ * degree prioritisation and adaptively shifts to salience-aware expansion once
+ * paths are discovered.
+ *
+ * **Key Innovation**: Unlike static prioritisation strategies (degree-only or
+ * salience-only), RSGE dynamically adapts its expansion strategy based on the
+ * quality of discovered paths. If early paths are low-salience, the algorithm
+ * automatically diversifies exploration to find higher-quality paths.
+ *
+ * **Two-Phase Priority Function**:
+ * - **Phase 1 (no paths yet)**: π(v) = deg(v) [ascending]
+ *   - Pure degree prioritisation, identical to DegreePrioritisedExpansion
+ *   - Defers high-degree nodes until paths are discovered
+ * - **Phase 2 (paths exist)**: π(v) = deg(v) × (1 - estimated_MI(v)) [ascending]
+ *   - Reduces priority (increases value) for nodes likely to be on high-MI paths
+ *   - Nodes with estimated_MI near 1.0 get lowest priority values (expanded first)
+ *   - Nodes with estimated_MI near 0.0 get priority near deg(v) (expanded later)
+ *
+ * **Rolling MI Estimation**:
+ * - Uses Jaccard similarity between node neighbours and discovered path nodes
+ * - Jaccard(v, P) = |neighbors(v) ∩ nodes(P)| / |neighbors(v) ∪ nodes(P)|
+ * - Estimated MI(v) = max over all discovered paths of Jaccard(v, P)
+ * - Higher Jaccard = node likely appears in similar high-quality paths
+ *
+ * **Self-Correcting Mechanism**:
+ * - If early paths are low-salience (low Jaccard scores for their nodes), the
+ *   algorithm diversifies by exploring nodes with low Jaccard similarity
+ * - If early paths are high-salience, the algorithm continues exploring similar
+ *   nodes to find more high-quality paths
+ *
+ * **Expected Behavior**:
+ * - Higher salience coverage than pure degree prioritisation
+ * - More efficient than salience-prioritised expansion (requires no pre-computation)
+ * - Adaptive exploration balances hub avoidance with path quality
+ *
+ * **Complexity**:
+ * - Time: O(E log V + P × D) where E = edges, V = vertices, P = paths, D = avg degree
+ * - Space: O(V + E + P × K) where K = avg path length
+ *
+ * @template T - Node data type
+ */
+export declare class RetrospectiveSalienceExpansion<T> {
+    private readonly expander;
+    private readonly seeds;
+    private readonly frontiers;
+    private readonly paths;
+    private readonly sampledEdges;
+    private stats;
+    /** Tracks when each node was first discovered (iteration number) */
+    private readonly nodeDiscoveryIteration;
+    /** Track which frontier owns each node for O(1) intersection checking */
+    private readonly nodeToFrontierIndex;
+    /** Track path signatures for O(1) deduplication */
+    private readonly pathSignatures;
+    /** Cache of node neighbor sets for Jaccard similarity */
+    private readonly neighborCache;
+    /** Current estimated MI scores for each node */
+    private readonly estimatedMI;
+    /** Phase tracking: false = degree-only, true = salience-aware */
+    private saliencePhaseActive;
+    /**
+     * Create a new retrospective salience-guided expansion.
+     *
+     * @param expander - Graph expander providing neighbour access
+     * @param seeds - Array of seed node IDs (N ≥ 1)
+     * @throws Error if no seeds provided
+     */
+    constructor(expander: GraphExpander<T>, seeds: readonly string[]);
+    /**
+     * Run the expansion to completion.
+     *
+     * Terminates when all frontiers are exhausted (no unexpanded nodes remain).
+     * This is the ONLY termination condition—no arbitrary limits.
+     *
+     * @returns Expansion results including paths and sampled subgraph
+     */
+    run(): Promise<DegreePrioritisedExpansionResult>;
+    /**
+     * Calculate priority for a node based on current phase.
+     *
+     * Phase 1: π(v) = deg(v)
+     * Phase 2: π(v) = deg(v) × (1 - estimated_MI(v))
+     *
+     * Lower priority = higher importance (expanded first in min-heap).
+     *
+     * @param nodeId - Node to calculate priority for
+     * @returns Priority value
+     * @internal
+     */
+    private calculateNodePriority;
+    /**
+     * Transition from Phase 1 (degree-only) to Phase 2 (salience-aware).
+     *
+     * Recomputes priorities for all nodes in all frontiers based on the first
+     * discovered path.
+     *
+     * @internal
+     */
+    private transitionToSaliencePhase;
+    /**
+     * Update MI estimates based on a newly discovered path.
+     *
+     * For each node in the graph, computes Jaccard similarity to the path nodes
+     * and updates the estimated MI to the maximum Jaccard across all paths.
+     *
+     * @param pathNodes - Array of node IDs in the discovered path
+     * @internal
+     */
+    private updateMIEstimates;
+    /**
+     * Compute Jaccard similarity between a node's neighbours and a set of path nodes.
+     *
+     * Jaccard(v, P) = |neighbors(v) ∩ nodes(P)| / |neighbors(v) ∪ nodes(P)|
+     *
+     * @param nodeId - Node to compute similarity for
+     * @param pathNodes - Set of node IDs in the path
+     * @returns Jaccard similarity in [0, 1]
+     * @internal
+     */
+    private computeJaccardSimilarity;
+    /**
+     * Check if any frontier has unexpanded nodes.
+     * @internal
+     */
+    private hasNonEmptyFrontier;
+    /**
+     * Select the frontier with the lowest-priority node at its front.
+     * Returns -1 if all frontiers are empty.
+     * @internal
+     */
+    private selectLowestPriorityFrontier;
+    /**
+     * Peek at the priority of the front item without removing it.
+     * @param queue
+     * @internal
+     */
+    private peekPriority;
+    /**
+     * Reconstruct path from meeting point between two frontiers.
+     * @param stateA
+     * @param stateB
+     * @param meetingNode
+     * @internal
+     */
+    private reconstructPath;
+    /**
+     * Create a unique signature for a path to enable O(1) deduplication.
+     * Signature is bidirectional (A-B same as B-A).
+     * @param fromSeed
+     * @param toSeed
+     * @param nodes
+     * @internal
+     */
+    private createPathSignature;
+    /**
+     * Record degree in distribution histogram.
+     * @param degree
+     * @internal
+     */
+    private recordDegree;
+    /**
+     * Get histogram bucket for a degree value.
+     * @param degree
+     * @internal
+     */
+    private getDegreeBucket;
+}
+//# sourceMappingURL=retrospective-salience-expansion.d.ts.map

package/dist/algorithms/traversal/retrospective-salience-expansion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrospective-salience-expansion.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/retrospective-salience-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAE,gCAAgC,EAAkB,MAAM,mCAAmC,CAAC;AAG1G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,qBAAa,8BAA8B,CAAC,CAAC;IA+B3C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,KAAK;IA/BvB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAuB;IACjD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoE;IAC1F,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAqB;IAClD,OAAO,CAAC,KAAK,CAAiB;IAC9B,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAA6B;IAEpE,yEAAyE;IACzE,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAA6B;IAEjE,mDAAmD;IACnD,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAqB;IAEpD,yDAAyD;IACzD,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAkC;IAEhE,gDAAgD;IAChD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA6B;IAEzD,iEAAiE;IACjE,OAAO,CAAC,mBAAmB,CAAS;IAEpC;;;;;;OAMG;gBAEe,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,MAAM,EAAE;IAkC1C;;;;;;;OAOG;IACG,GAAG,IAAI,OAAO,CAAC,gCAAgC,CAAC;IAsGtD;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;;;;;;OAOG;YACW,yBAAyB;IA4BvC;;;;;;;;OAQG;YACW,iBAAiB;IAoB/B;;;;;;;;;OASG;YACW,wBAAwB;IAkCtC;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAI3B;;;;OAIG;IACH,OAAO,CAAC,4BAA4B;IAmBpC;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAKpB;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;IAkCvB;;;;;;;OAOG;IACH,OAAO,CAAC,mBAAmB;IAM3B;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAMpB;;;;OAIG;IACH,OAAO,CAAC,eAAe;CASvB"}

package/dist/algorithms/traversal/retrospective-salience-expansion.unit.test.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Unit tests for retrospective salience-guided expansion algorithm
+ */
+export {};
+//# sourceMappingURL=retrospective-salience-expansion.unit.test.d.ts.map

package/dist/algorithms/traversal/retrospective-salience-expansion.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrospective-salience-expansion.unit.test.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/retrospective-salience-expansion.unit.test.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/algorithms/traversal/salience-prioritised-expansion.d.ts

@@ -0,0 +1,149 @@
+import { GraphExpander } from '../../interfaces/graph-expander.js';
+import { DegreePrioritisedExpansionResult } from './degree-prioritised-expansion.js';
+/**
+ * Salience-Prioritised Multi-Seed Graph Expansion
+ *
+ * **Novel Contribution**: Path quality-aware node expansion that prioritizes
+ * nodes based on their participation in high-salience paths, rather than
+ * degree-based prioritization.
+ *
+ * **Key Innovation**: Unlike degree-prioritised expansion (which avoids hubs
+ * by expanding low-degree nodes first), salience-prioritised expansion actively
+ * seeks out nodes that appear in high-quality (high-MI) paths. This should
+ * result in higher salience coverage because the expansion naturally gravitates
+ * toward the same paths that Path Salience ranking identifies as important.
+ *
+ * **Design Relationship**:
+ * - DegreePrioritisedExpansion: Priority = node degree (ascending)
+ * - SaliencePrioritisedExpansion: Priority = node salience score (descending)
+ *
+ * **Priority Function**:
+ * - Primary: Node salience score (higher = better priority)
+ * - Secondary: Node degree (lower = better, for tie-breaking hub avoidance)
+ *
+ * **Expected Behavior**:
+ * - Higher salience coverage than degree-prioritised expansion
+ * - Discovered paths should more closely match Path Salience top-K
+ * - May sacrifice some hub-avoidance for path quality
+ *
+ * @template T - Node data type
+ */
+export declare class SaliencePrioritisedExpansion<T> implements GraphExpander<T> {
+    /** Salience scores for each node (pre-computed from Path Salience ranking) */
+    private readonly nodeSalience;
+    /** The underlying graph expander for neighbor access */
+    private readonly expander;
+    /** Seed nodes for expansion */
+    private readonly seeds;
+    /** Frontiers (one per seed) */
+    private readonly frontiers;
+    /** Statistics collected during expansion */
+    private stats;
+    /** Discovered paths between seed pairs */
+    private readonly paths;
+    /** Track which frontier owns each node */
+    private readonly nodeToFrontierIndex;
+    /** Track which seed pairs have connected */
+    private readonly connectedPairs;
+    /** Tracks when each node was first discovered (iteration number) */
+    private readonly nodeDiscoveryIteration;
+    /**
+     * Create a new salience-prioritised expansion.
+     *
+     * @param expander - Underlying graph expander for neighbor access
+     * @param seeds - Array of seed node IDs
+     * @param nodeSalience - Map of node ID to salience score (appearance count in top-K paths)
+     */
+    constructor(expander: GraphExpander<T>, seeds: string[], nodeSalience: Map<string, number>);
+    /**
+     * Get neighbors of a node.
+     * @param nodeId
+     */
+    getNeighbors(nodeId: string): Promise<{
+        targetId: string;
+        relationshipType: string;
+    }[]>;
+    /**
+     * Get node degree for priority computation.
+     * @param nodeId
+     */
+    getDegree(nodeId: string): number;
+    /**
+     * Calculate weighted priority (delegates to underlying expander).
+     * @param nodeId
+     */
+    calculatePriority(nodeId: string): number;
+    /**
+     * Get node data.
+     * @param nodeId
+     */
+    getNode(nodeId: string): Promise<T | null>;
+    /**
+     * Add an edge to the output.
+     * @param source
+     * @param target
+     * @param relationshipType
+     */
+    addEdge(source: string, target: string, relationshipType: string): void;
+    /**
+     * Run the expansion to completion.
+     */
+    run(): Promise<DegreePrioritisedExpansionResult>;
+    /**
+     * Check if any frontier has unexpanded nodes.
+     */
+    private hasNonEmptyFrontier;
+    /**
+     * Select the frontier with the highest-salience node.
+     */
+    private selectHighestSalienceFrontier;
+    /**
+     * Reconstruct path between two seeds using parent pointers.
+     * @param fromFrontier
+     * @param fromFrontier.index
+     * @param fromFrontier.visited
+     * @param fromFrontier.parents
+     * @param toFrontier
+     * @param toFrontier.index
+     * @param toFrontier.visited
+     * @param toFrontier.parents
+     * @param meetingNode
+     */
+    private reconstructPath;
+    /**
+     * Record degree in statistics.
+     * @param degree
+     */
+    private recordDegree;
+    /**
+     * Get degree bucket for statistics.
+     * @param degree
+     */
+    private getDegreeBucket;
+}
+/**
+ * Compute node salience scores from top-K salient paths.
+ *
+ * For each node, counts how many times it appears in the top-K salient paths.
+ * Nodes that appear more frequently in high-quality paths get higher scores.
+ *
+ * @param topKPaths - Array of top-K salient paths (as node ID arrays)
+ * @returns Map of node ID to salience score (appearance count)
+ */
+export declare const computeNodeSalienceScores: (topKPaths: string[][]) => Map<string, number>;
+/**
+ * Compute node salience scores directly from Path Salience ranking results.
+ *
+ * Extracts node IDs from ranked path objects and computes appearance counts.
+ *
+ * @param rankedPaths - Array of ranked paths from Path Salience algorithm
+ * @returns Map of node ID to salience score
+ */
+export declare const computeNodeSalienceFromRankedPaths: (rankedPaths: Array<{
+    path: {
+        nodes: Array<{
+            id: string;
+        }>;
+    };
+}>) => Map<string, number>;
+//# sourceMappingURL=salience-prioritised-expansion.d.ts.map

package/dist/algorithms/traversal/salience-prioritised-expansion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"salience-prioritised-expansion.d.ts","sourceRoot":"","sources":["../../../src/algorithms/traversal/salience-prioritised-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAE,gCAAgC,EAAkB,MAAM,mCAAmC,CAAC;AAG1G;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,4BAA4B,CAAC,CAAC,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IACvE,8EAA8E;IAC9E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAsB;IAEnD,wDAAwD;IACxD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAmB;IAE5C,+BAA+B;IAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IAEjC,+BAA+B;IAC/B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAKlB;IAER,4CAA4C;IAC5C,OAAO,CAAC,KAAK,CAKX;IAEF,0CAA0C;IAC1C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoE;IAE1F,0CAA0C;IAC1C,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAA6B;IAEjE,4CAA4C;IAC5C,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAqB;IAEpD,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAA6B;IAEpE;;;;;;OAMG;gBACS,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAgC1F;;;OAGG;IACG,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAI7F;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIjC;;;OAGG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIzC;;;OAGG;IACG,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC;IAIhD;;;;;OAKG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI;IAIvE;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,gCAAgC,CAAC;IAwFtD;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAI3B;;OAEG;IACH,OAAO,CAAC,6BAA6B;IAkBrC;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,eAAe;IAgCvB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAMpB;;;OAGG;IACH,OAAO,CAAC,eAAe;CASvB;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,yBAAyB,GAAI,WAAW,MAAM,EAAE,EAAE,KAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAWnF,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,kCAAkC,GAAI,aAAa,KAAK,CAAC;IAAE,IAAI,EAAE;QAAE,KAAK,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE,CAAA;CAAE,CAAC,KAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAGrI,CAAC"}

package/dist/algorithms/types/clustering-types.d.ts

@@ -431,7 +431,7 @@ export type HierarchicalError = {
  * @template T - Node identifier type (typically string)
  * @remarks
  * This interface defines the data structure returned by the Louvain algorithm.
- * The actual function returns `Result<LouvainResult<string>, ClusteringError>`.
+ * The actual function returns `Result<LouvainResult<string>, ClusteringError>` (see clustering/louvain.ts).
  *
  * **Performance Characteristics** (1000-node graph):
  * - Phase 1 (Parameter Tuning): ~10-12 seconds
@@ -443,7 +443,7 @@ export type HierarchicalError = {
  * - Auto mode (large graphs): Modularity ~0.19 (5% loss for 3-6x speedup)
  * - Random mode: Modularity ~0.18-0.19 (acceptable for speed-critical use cases)
  */
-export interface LouvainResult<T = string> {
+export interface LouvainDesignResult<T = string> {
     /** Map of community ID → community structure */
     communities: Map<number, Community<T>>;
     /** Modularity score (range: [-0.5, 1.0], higher is better) */

package/dist/algorithms/types/clustering-types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"clustering-types.d.ts","sourceRoot":"","sources":["../../../src/algorithms/types/clustering-types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAMvC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC;AAEnC;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEvC;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAMtC;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,uCAAuC;IACvC,EAAE,EAAE,WAAW,CAAC;IAEhB,+CAA+C;IAC/C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,2CAA2C;IAC3C,aAAa,EAAE,MAAM,CAAC;IAEtB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IAEtB,8CAA8C;IAC9C,UAAU,EAAE,MAAM,CAAC;IAEnB,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAEhB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,sCAAsC;IACtC,EAAE,EAAE,WAAW,CAAC;IAEhB,uCAAuC;IACvC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IAEjB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IAEjB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IAEjB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IAEjB,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B,oEAAoE;IACpE,MAAM,EAAE,SAAS,EAAE,CAAC;IAEpB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB,kDAAkD;IAClD,SAAS,EAAE,CAAC,EAAE,CAAC;IAEf,gDAAgD;IAChD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtC;;;;OAIG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;CAC9C;AAED;;;GAGG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC;IACtB,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IAEV,0BAA0B;IAC1B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IAEnB,kEAAkE;IAClE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,qCAAqC;IACrC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,WAAW,EAAE,OAAO,CAAC;IAErB,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IAEtB,gDAAgD;IAChD,WAAW,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC9B,kEAAkE;IAClE,KAAK,EAAE,SAAS,CAAC;IAEjB,4BAA4B;IAC5B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IAEb,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC;IAEnB,qDAAqD;IACrD,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,wBAAwB;IACxB,EAAE,EAAE,QAAQ,CAAC;IAEb,2BAA2B;IAC3B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,0DAA0D;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IAE1B,mEAAmE;IACnE,gBAAgB,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACxC,sDAAsD;IACtD,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,2DAA2D;IAC3D,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,4CAA4C;IAC5C,cAAc,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/B,oEAAoE;IACpE,aAAa,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACtC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,0CAA0C;IAC1C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IAEb,8DAA8D;IAC9D,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3B,yDAAyD;IACzD,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,kEAAkE;IAClE,UAAU,EAAE,MAAM,CAAC;IAEnB,gEAAgE;IAChE,cAAc,EAAE,MAAM,CAAC;IAEvB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IAEnB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAC;IAEpB,yDAAyD;IACzD,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B,2EAA2E;IAC3E,aAAa,EAAE,MAAM,CAAC;CACtB;AAMD;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACpC;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;IAElC;;;;;;;;;OASG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;;;;;;OAWG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B;;;;;;;;;;;;;;;OAeG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACvC;;;;;;;OAOG;IACH,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAMrD;;GAEG;AACH,MAAM,MAAM,eAAe,GACvB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,uBAAuB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAC1B;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAM/D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,GAAG,MAAM;IACxC,gDAAgD;IAChD,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvC,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IAEnB,uEAAuE;IACvE,MAAM,EAAE,MAAM,CAAC;IAEf,yCAAyC;IACzC,QAAQ,EAAE;QACT,wCAAwC;QACxC,SAAS,EAAE,MAAM,CAAC;QAElB,oCAAoC;QACpC,OAAO,EAAE,MAAM,CAAC;QAEhB,mDAAmD;QACnD,eAAe,EAAE,MAAM,CAAC;QAExB,2DAA2D;QAC3D,aAAa,EAAE,QAAQ,CAAC,oBAAoB,CAAC,CAAC;KAC9C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,MAAM,CACnC;IACC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;IAClC,OAAO,EAAE,cAAc,CAAC;IACxB,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,UAAU,CAAC,EAAE,MAAM,CAAC;YACpB,aAAa,CAAC,EAAE,MAAM,CAAC;SACvB,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAAI,MAAM,CAC7C;IACC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,mBAAmB,CAAC;QAC/B,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,MAAM,CACpC;IACC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,EAAE,cAAc,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE;QACT,SAAS,EAAE,SAAS,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,SAAS,CAAC,EAAE,MAAM,CAAC;YACnB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,CAAC,CAAC,IAAI,MAAM,CAC9C;IACC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACT,SAAS,EAAE,UAAU,CAAC;QACtB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,CAAC,EAAE,MAAM,CAAC;YACV,gBAAgB,CAAC,EAAE,MAAM,CAAC;SAC1B,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,MAAM,CACzC;IACC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,QAAQ,EAAE;QACT,SAAS,EAAE,cAAc,CAAC;QAC1B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,OAAO,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;SAC3C,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,MAAM,CAClC;IACC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,MAAM,CAC1C;IACC,SAAS,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACrC,QAAQ,EAAE;QACT,SAAS,EAAE,gBAAgB,CAAC;QAC5B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,OAAO,CAAC,EAAE,MAAM,CAAC;SACjB,CAAC;KACF,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,IAAI,MAAM,CACxC;IACC,UAAU,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,QAAQ,EAAE;QACT,SAAS,EAAE,aAAa,CAAC;QACzB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC"}
+{"version":3,"file":"clustering-types.d.ts","sourceRoot":"","sources":["../../../src/algorithms/types/clustering-types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAMvC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;;GAGG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC;AAEnC;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEvC;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAMtC;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,uCAAuC;IACvC,EAAE,EAAE,WAAW,CAAC;IAEhB,+CAA+C;IAC/C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,2CAA2C;IAC3C,aAAa,EAAE,MAAM,CAAC;IAEtB,kDAAkD;IAClD,aAAa,EAAE,MAAM,CAAC;IAEtB,8CAA8C;IAC9C,UAAU,EAAE,MAAM,CAAC;IAEnB,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAEhB,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IAC3B,sCAAsC;IACtC,EAAE,EAAE,WAAW,CAAC;IAEhB,uCAAuC;IACvC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IAEjB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,CAAC;IAEjB,4DAA4D;IAC5D,QAAQ,EAAE,MAAM,CAAC;IAEjB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;IAEjB,uCAAuC;IACvC,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B,oEAAoE;IACpE,MAAM,EAAE,SAAS,EAAE,CAAC;IAEpB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB,kDAAkD;IAClD,SAAS,EAAE,CAAC,EAAE,CAAC;IAEf,gDAAgD;IAChD,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtC;;;;OAIG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;CAC9C;AAED;;;GAGG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC;IACtB,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IAEV,0BAA0B;IAC1B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IAEb,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IAEnB,kEAAkE;IAClE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAC5B;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,qCAAqC;IACrC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,WAAW,EAAE,OAAO,CAAC;IAErB,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IAEtB,gDAAgD;IAChD,WAAW,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC9B,kEAAkE;IAClE,KAAK,EAAE,SAAS,CAAC;IAEjB,4BAA4B;IAC5B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IAEb,iEAAiE;IACjE,UAAU,EAAE,MAAM,CAAC;IAEnB,qDAAqD;IACrD,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,wBAAwB;IACxB,EAAE,EAAE,QAAQ,CAAC;IAEb,2BAA2B;IAC3B,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,0DAA0D;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IAE1B,mEAAmE;IACnE,gBAAgB,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,gBAAgB,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACxC,sDAAsD;IACtD,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,2DAA2D;IAC3D,cAAc,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvB,4CAA4C;IAC5C,cAAc,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/B,oEAAoE;IACpE,aAAa,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACtC,2BAA2B;IAC3B,EAAE,EAAE,WAAW,CAAC;IAEhB,0CAA0C;IAC1C,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAEd,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IAEb,8DAA8D;IAC9D,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAE3B,yDAAyD;IACzD,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,kEAAkE;IAClE,UAAU,EAAE,MAAM,CAAC;IAEnB,gEAAgE;IAChE,cAAc,EAAE,MAAM,CAAC;IAEvB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IAEnB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAC;IAEpB,yDAAyD;IACzD,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B,2EAA2E;IAC3E,aAAa,EAAE,MAAM,CAAC;CACtB;AAMD;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACpC;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;IAElC;;;;;;;;;OASG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;;;;;;;;;OAWG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAE/B;;;;;;;;;;;;;;;OAeG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACvC;;;;;;;OAOG;IACH,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAMrD;;GAEG;AACH,MAAM,MAAM,eAAe,GACvB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,uBAAuB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,kBAAkB,GAC1B;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAErF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAChF;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAM/D;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,mBAAmB,CAAC,CAAC,GAAG,MAAM;IAC9C,gDAAgD;IAChD,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvC,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IAEnB,uEAAuE;IACvE,MAAM,EAAE,MAAM,CAAC;IAEf,yCAAyC;IACzC,QAAQ,EAAE;QACT,wCAAwC;QACxC,SAAS,EAAE,MAAM,CAAC;QAElB,oCAAoC;QACpC,OAAO,EAAE,MAAM,CAAC;QAEhB,mDAAmD;QACnD,eAAe,EAAE,MAAM,CAAC;QAExB,2DAA2D;QAC3D,aAAa,EAAE,QAAQ,CAAC,oBAAoB,CAAC,CAAC;KAC9C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,MAAM,CACnC;IACC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;IAClC,OAAO,EAAE,cAAc,CAAC;IACxB,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,UAAU,CAAC,EAAE,MAAM,CAAC;YACpB,aAAa,CAAC,EAAE,MAAM,CAAC;SACvB,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAAI,MAAM,CAC7C;IACC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,mBAAmB,CAAC;QAC/B,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,MAAM,CACpC;IACC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,EAAE,cAAc,CAAC;IACxB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE;QACT,SAAS,EAAE,SAAS,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,SAAS,CAAC,EAAE,MAAM,CAAC;YACnB,IAAI,CAAC,EAAE,MAAM,CAAC;SACd,CAAC;KACF,CAAC;CACF,EACD,eAAe,CACf,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,CAAC,CAAC,IAAI,MAAM,CAC9C;IACC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACT,SAAS,EAAE,UAAU,CAAC;QACtB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,CAAC,EAAE,MAAM,CAAC;YACV,gBAAgB,CAAC,EAAE,MAAM,CAAC;SAC1B,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,kBAAkB,CAAC,CAAC,IAAI,MAAM,CACzC;IACC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,QAAQ,EAAE;QACT,SAAS,EAAE,cAAc,CAAC;QAC1B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE;YACX,OAAO,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;SAC3C,CAAC;KACF,CAAC;CACF,EACD,iBAAiB,CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,MAAM,CAClC;IACC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5B,QAAQ,EAAE;QACT,SAAS,EAAE,QAAQ,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,IAAI,MAAM,CAC1C;IACC,SAAS,EAAE,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACrC,QAAQ,EAAE;QACT,SAAS,EAAE,gBAAgB,CAAC;QAC5B,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,OAAO,CAAC;QACnB,UAAU,EAAE;YACX,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,aAAa,CAAC,EAAE,MAAM,CAAC;YACvB,OAAO,CAAC,EAAE,MAAM,CAAC;SACjB,CAAC;KACF,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,IAAI,MAAM,CACxC;IACC,UAAU,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,QAAQ,EAAE;QACT,SAAS,EAAE,aAAa,CAAC;QACzB,OAAO,EAAE,MAAM,CAAC;KAChB,CAAC;CACF,EACD,kBAAkB,CAClB,CAAC"}

package/dist/algorithms/utils/csr.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"csr.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/csr.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,KAAK,IAAI,EAAC,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACvD;;;;;;;OAOG;IACH,OAAO,EAAE,WAAW,CAAC;IAErB;;;;;;;OAOG;IACH,KAAK,EAAE,WAAW,CAAC;IAEnB;;;;;;;OAOG;IACH,OAAO,EAAE,YAAY,CAAC;IAEtB;;;;;;;OAOG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;;;;;;OAOG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/B;;;;;OAKG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CA2E9F,CAAC"}
+{"version":3,"file":"csr.d.ts","sourceRoot":"","sources":["../../../src/algorithms/utils/csr.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,KAAK,IAAI,EAAC,KAAK,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI;IACvD;;;;;;;OAOG;IACH,OAAO,EAAE,WAAW,CAAC;IAErB;;;;;;;OAOG;IACH,KAAK,EAAE,WAAW,CAAC;IAEnB;;;;;;;OAOG;IACH,OAAO,EAAE,YAAY,CAAC;IAEtB;;;;;;;OAOG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;;;;;;OAOG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/B;;;;;OAKG;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,YAAY,GAAI,CAAC,SAAS,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CA+F9F,CAAC"}

package/dist/analyzer/advanced-props.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"advanced-props.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-props.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EACb,MAAM,SAAS,CAAC;AAKjB,eAAO,MAAM,gBAAgB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,qBAAqB,CAAC;IAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAA;CAqBhL,CAAC;AAEF,eAAO,MAAM,cAAc,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,cAAc,CAAA;CAS1I,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAClB;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAAE,GAC1B;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,cAAc,CAAA;CAkBzB,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,cAAc,CAAA;CAAE,GACxB;IAAE,IAAI,EAAE,aAAa,CAAA;CAAE,GACvB;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GACrB;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAc3B,CAAC;AAEF,eAAO,MAAM,mBAAmB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAItH,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAIzH,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAiBlJ,CAAC;AAEF,eAAO,MAAM,2BAA2B,GAAI,GAAG,aAAa,KACxD;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAC3B;IAAE,IAAI,EAAE,0BAA0B,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,YAAY,CAAA;CAevB,CAAC;AAEF,eAAO,MAAM,uBAAuB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAmBtI,CAAC"}
+{"version":3,"file":"advanced-props.d.ts","sourceRoot":"","sources":["../../src/analyzer/advanced-props.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACX,aAAa,EACb,aAAa,EACb,MAAM,SAAS,CAAC;AAKjB,eAAO,MAAM,gBAAgB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,qBAAqB,CAAC;IAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAA;CAwBhL,CAAC;AAEF,eAAO,MAAM,cAAc,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,cAAc,CAAA;CAS1I,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAClB;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAAE,GAC1B;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,cAAc,CAAA;CAkBzB,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KACnE;IAAE,IAAI,EAAE,cAAc,CAAA;CAAE,GACxB;IAAE,IAAI,EAAE,aAAa,CAAA;CAAE,GACvB;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GACrB;IAAE,IAAI,EAAE,gBAAgB,CAAA;CAc3B,CAAC;AAEF,eAAO,MAAM,mBAAmB,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAItH,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,GAAG,aAAa,EAAE,QAAQ,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,wBAAwB,CAAA;CAIzH,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,oBAAoB,CAAA;CAiBlJ,CAAC;AAEF,eAAO,MAAM,2BAA2B,GAAI,GAAG,aAAa,KACxD;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAC3B;IAAE,IAAI,EAAE,0BAA0B,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,YAAY,CAAA;CAevB,CAAC;AAEF,eAAO,MAAM,uBAAuB,GAAI,GAAG,aAAa,KAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAmBtI,CAAC"}

package/dist/analyzer/forbidden-subgraph.d.ts

@@ -0,0 +1,59 @@
+import { ATFree, BullFree, C5Free, DistanceHereditary, GemFree, HHFree, P5Free, WeaklyChordal } from '../generation/spec/forbidden-subgraph.js';
+import { AnalyzerGraph, ComputePolicy } from './types.js';
+/**
+ * Compute P5Free property from graph structure.
+ * Contains no induced path on 5 vertices
+ * @param g
+ * @param _policy
+ */
+export declare const computeP5Free: (g: AnalyzerGraph, _policy: ComputePolicy) => P5Free;
+/**
+ * Compute C5Free property from graph structure.
+ * Contains no induced cycle on 5 vertices
+ * @param g
+ * @param _policy
+ */
+export declare const computeC5Free: (g: AnalyzerGraph, _policy: ComputePolicy) => C5Free;
+/**
+ * Compute BullFree property from graph structure.
+ * Contains no induced bull graph
+ * @param g
+ * @param _policy
+ */
+export declare const computeBullFree: (g: AnalyzerGraph, _policy: ComputePolicy) => BullFree;
+/**
+ * Compute GemFree property from graph structure.
+ * Contains no induced gem graph
+ * @param g
+ * @param _policy
+ */
+export declare const computeGemFree: (g: AnalyzerGraph, _policy: ComputePolicy) => GemFree;
+/**
+ * Compute ATFree property from graph structure.
+ * No asteroidal triple of vertices
+ * @param g
+ * @param _policy
+ */
+export declare const computeATFree: (g: AnalyzerGraph, _policy: ComputePolicy) => ATFree;
+/**
+ * Compute HHFree property from graph structure.
+ * No induced house or hole (cycle of length >= 5)
+ * @param g
+ * @param _policy
+ */
+export declare const computeHHFree: (g: AnalyzerGraph, _policy: ComputePolicy) => HHFree;
+/**
+ * Compute DistanceHereditary property from graph structure.
+ * Distances preserved in all connected induced subgraphs
+ * @param g
+ * @param _policy
+ */
+export declare const computeDistanceHereditary: (g: AnalyzerGraph, _policy: ComputePolicy) => DistanceHereditary;
+/**
+ * Compute WeaklyChordal property from graph structure.
+ * No induced hole or anti-hole of length >= 5
+ * @param g
+ * @param _policy
+ */
+export declare const computeWeaklyChordal: (g: AnalyzerGraph, _policy: ComputePolicy) => WeaklyChordal;
+//# sourceMappingURL=forbidden-subgraph.d.ts.map

package/dist/analyzer/forbidden-subgraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"forbidden-subgraph.d.ts","sourceRoot":"","sources":["../../src/analyzer/forbidden-subgraph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,OAAO,KAAK,EACX,MAAM,EACN,QAAQ,EACR,MAAM,EACN,kBAAkB,EAClB,OAAO,EACP,MAAM,EACN,MAAM,EACN,aAAa,EACb,MAAM,0CAA0C,CAAC;AAMlD,OAAO,KAAK,EAAE,aAAa,EAAG,aAAa,EAAE,MAAM,YAAY,CAAC;AAuDhE;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAC3B,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,QAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,cAAc,GAC1B,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,OAKF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAiBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GACzB,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,MAyBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,yBAAyB,GACrC,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,kBAiBF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,oBAAoB,GAChC,GAAG,aAAa,EAChB,SAAS,aAAa,KACpB,aAyDF,CAAC"}