@harness-engineering/graph 0.3.1 → 0.3.3

package/dist/index.d.mts

@@ -244,10 +244,27 @@ declare class ContextQL {
     private readonly store;
     constructor(store: GraphStore);
     execute(params: ContextQLParams): ContextQLResult;
+    private seedRootNodes;
+    private runBFS;
+    private gatherEdges;
 }
 
 declare function project(nodes: readonly GraphNode[], spec: ProjectionSpec | undefined): Partial<GraphNode>[];
 
+interface ImpactGroups {
+    readonly tests: readonly GraphNode[];
+    readonly docs: readonly GraphNode[];
+    readonly code: readonly GraphNode[];
+    readonly other: readonly GraphNode[];
+}
+/**
+ * Group graph nodes into impact categories (tests, docs, code, other).
+ * Excludes the root node from the results.
+ *
+ * Shared by both the NLQ orchestrator and the MCP get_impact handler.
+ */
+declare function groupNodesByImpact(nodes: readonly GraphNode[], excludeId?: string): ImpactGroups;
+
 /**
  * Ingests TypeScript/JavaScript files into the graph via regex-based parsing.
  * Future: upgrade to tree-sitter for full AST parsing.
@@ -256,8 +273,17 @@ declare class CodeIngestor {
     private readonly store;
     constructor(store: GraphStore);
     ingest(rootDir: string): Promise<IngestResult>;
+    private processFile;
+    private trackCallable;
     private findSourceFiles;
     private extractSymbols;
+    private tryExtractFunction;
+    private tryExtractClass;
+    private tryExtractInterface;
+    /** Update brace tracking; returns true when line is consumed (class ended or tracked). */
+    private updateClassContext;
+    private tryExtractMethod;
+    private tryExtractVariable;
     /**
      * Find the closing brace for a construct starting at the given line.
      * Uses a simple brace-counting heuristic. Returns 1-indexed line number.
@@ -371,6 +397,7 @@ declare class JiraConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private processIssue;
 }
 
 declare class SlackConnector implements GraphConnector {
@@ -379,6 +406,7 @@ declare class SlackConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private processChannel;
 }
 
 declare class ConfluenceConnector implements GraphConnector {
@@ -387,6 +415,8 @@ declare class ConfluenceConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllPages;
+    private processPage;
 }
 
 declare class CIConnector implements GraphConnector {
@@ -465,6 +495,10 @@ declare class GraphEntropyAdapter {
      * 3. Unreachable = code nodes NOT in visited set
      */
     computeDeadCodeData(): GraphDeadCodeData;
+    private findEntryPoints;
+    private bfsFromEntryPoints;
+    private enqueueOutboundEdges;
+    private collectUnreachableNodes;
     /**
      * Count all nodes and edges by type.
      */
@@ -495,6 +529,13 @@ declare class GraphComplexityAdapter {
      * 5. Compute 95th percentile
      */
     computeComplexityHotspots(): GraphComplexityResult;
+    /**
+     * Walk the 'contains' edges to find the file node that contains a given function/method.
+     * For methods, walks through the intermediate class node.
+     */
+    private findContainingFileId;
+    private findParentFileOfClass;
+    private getChangeFrequency;
     private computePercentile;
 }
 
@@ -573,6 +614,148 @@ declare class GraphAnomalyAdapter {
     private computeRemovalImpact;
 }
 
+/**
+ * All supported intent categories for natural language graph queries.
+ * Runtime-accessible array mirroring NODE_TYPES / EDGE_TYPES pattern.
+ */
+declare const INTENTS: readonly ["impact", "find", "relationships", "explain", "anomaly"];
+/**
+ * Intent categories for natural language graph queries.
+ */
+type Intent = (typeof INTENTS)[number];
+/**
+ * Result of classifying a natural language question into an intent.
+ */
+interface ClassificationResult {
+    readonly intent: Intent;
+    readonly confidence: number;
+    readonly signals: Readonly<Record<string, number>>;
+}
+/**
+ * An entity mention from the query resolved to a graph node.
+ */
+interface ResolvedEntity {
+    readonly raw: string;
+    readonly nodeId: string;
+    readonly node: GraphNode;
+    readonly confidence: number;
+    readonly method: 'exact' | 'fusion' | 'path';
+}
+/**
+ * Complete result from askGraph, including intent, entities, summary, and raw data.
+ */
+interface AskGraphResult {
+    readonly intent: Intent;
+    readonly intentConfidence: number;
+    readonly entities: readonly ResolvedEntity[];
+    readonly summary: string;
+    readonly data: unknown;
+    readonly suggestions?: readonly string[];
+}
+
+/**
+ * Scored multi-signal intent classifier.
+ *
+ * Combines keyword presence, question-word matching, and verb-pattern matching
+ * to classify natural language questions into one of 5 intents with a confidence
+ * score between 0 and 1.
+ */
+declare class IntentClassifier {
+    /**
+     * Classify a natural language question into an intent.
+     *
+     * @param question - The natural language question to classify
+     * @returns ClassificationResult with intent, confidence, and per-signal scores
+     */
+    classify(question: string): ClassificationResult;
+    /**
+     * Score individual signals for an intent against the normalized query.
+     */
+    private scoreIntent;
+    /**
+     * Score keyword signal: uses word-stem matching (checks if any word in the
+     * query starts with the keyword). Saturates at 2 matches to avoid penalizing
+     * intents with many keywords when only a few appear in the query.
+     */
+    private scoreKeywords;
+    /**
+     * Score question-word signal: 1.0 if the query starts with a matching
+     * question word, 0 otherwise.
+     */
+    private scoreQuestionWord;
+    /**
+     * Score verb-pattern signal: any matching pattern yields a strong score.
+     * Multiple matches increase score but saturate quickly.
+     */
+    private scoreVerbPatterns;
+    /**
+     * Combine individual signal scores into a single confidence score
+     * using additive weighted scoring. Each signal contributes weight * score,
+     * and the total weights sum to 1.0 so the result is naturally bounded [0, 1].
+     */
+    private combineSignals;
+}
+
+declare class EntityExtractor {
+    /**
+     * Extract candidate entity mentions from a natural language query.
+     *
+     * @param query - The natural language query to extract entities from
+     * @returns Array of raw entity strings in priority order, deduplicated
+     */
+    extract(query: string): readonly string[];
+}
+
+/**
+ * Resolves raw entity strings to graph nodes using a 3-step fuzzy cascade:
+ *
+ * 1. Exact name match via store.findNodes({ name })
+ * 2. FusionLayer search (if provided), take top result if score > 0.5
+ * 3. Path match on file nodes via path.includes(raw)
+ *
+ * Each step tags its match with method and confidence.
+ * Unresolved entities are silently omitted from results.
+ */
+declare class EntityResolver {
+    private readonly store;
+    private readonly fusion;
+    constructor(store: GraphStore, fusion?: FusionLayer);
+    /**
+     * Resolve an array of raw entity strings to graph nodes.
+     *
+     * @param raws - Raw entity strings from EntityExtractor
+     * @returns Array of ResolvedEntity for each successfully resolved raw string
+     */
+    resolve(raws: readonly string[]): readonly ResolvedEntity[];
+    private resolveOne;
+}
+
+/**
+ * Template-based response formatter that generates human-readable summaries
+ * from graph operation results, one template per intent.
+ */
+declare class ResponseFormatter {
+    /**
+     * Format graph operation results into a human-readable summary.
+     *
+     * @param intent - The classified intent
+     * @param entities - Resolved entities from the query
+     * @param data - Raw result data (shape varies per intent)
+     * @param query - Original natural language query (optional)
+     * @returns Human-readable summary string
+     */
+    format(intent: Intent, entities: readonly ResolvedEntity[], data: unknown, query?: string): string;
+    private formatImpact;
+    private formatFind;
+    private formatRelationships;
+    private formatExplain;
+    private formatAnomaly;
+    private safeArrayLength;
+    private p;
+}
+
+declare function askGraph(store: GraphStore, question: string): Promise<AskGraphResult>;
+
 interface AssembledContext {
     readonly nodes: readonly GraphNode[];
     readonly edges: readonly GraphEdge[];
@@ -606,6 +789,8 @@ declare class Assembler {
      * Assemble context relevant to an intent string within a token budget.
      */
     assembleContext(intent: string, tokenBudget?: number): AssembledContext;
+    private expandSearchResults;
+    private truncateToFit;
     /**
      * Compute a token budget allocation across node types.
      */
@@ -706,6 +891,80 @@ declare class GraphFeedbackAdapter {
     computeHarnessCheckData(): GraphHarnessCheckData;
 }
 
+interface TaskDefinition {
+    readonly id: string;
+    readonly files: readonly string[];
+}
+interface IndependenceCheckParams {
+    readonly tasks: readonly TaskDefinition[];
+    readonly depth?: number;
+    readonly edgeTypes?: readonly string[];
+}
+interface OverlapDetail {
+    readonly file: string;
+    readonly type: 'direct' | 'transitive';
+    readonly via?: string;
+}
+interface PairResult {
+    readonly taskA: string;
+    readonly taskB: string;
+    readonly independent: boolean;
+    readonly overlaps: readonly OverlapDetail[];
+}
+interface IndependenceResult {
+    readonly tasks: readonly string[];
+    readonly analysisLevel: 'graph-expanded' | 'file-only';
+    readonly depth: number;
+    readonly pairs: readonly PairResult[];
+    readonly groups: readonly (readonly string[])[];
+    readonly verdict: string;
+}
+declare class TaskIndependenceAnalyzer {
+    private readonly store;
+    constructor(store?: GraphStore);
+    analyze(params: IndependenceCheckParams): IndependenceResult;
+    private validate;
+    private expandViaGraph;
+    private computePairOverlap;
+    private buildGroups;
+    private generateVerdict;
+}
+
+type ConflictSeverity = 'high' | 'medium' | 'low';
+interface ConflictDetail {
+    readonly taskA: string;
+    readonly taskB: string;
+    readonly severity: ConflictSeverity;
+    readonly reason: string;
+    readonly mitigation: string;
+    readonly overlaps: readonly OverlapDetail[];
+}
+interface ConflictPrediction {
+    readonly tasks: readonly string[];
+    readonly analysisLevel: 'graph-expanded' | 'file-only';
+    readonly depth: number;
+    readonly conflicts: readonly ConflictDetail[];
+    readonly groups: readonly (readonly string[])[];
+    readonly summary: {
+        readonly high: number;
+        readonly medium: number;
+        readonly low: number;
+        readonly regrouped: boolean;
+    };
+    readonly verdict: string;
+}
+declare class ConflictPredictor {
+    private readonly store;
+    constructor(store?: GraphStore);
+    predict(params: IndependenceCheckParams): ConflictPrediction;
+    private classifyPair;
+    private severityRank;
+    private computePercentile;
+    private buildHighSeverityGroups;
+    private groupsEqual;
+    private generateVerdict;
+}
+
 declare const VERSION = "0.2.0";
 
-export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };
+export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, type ClassificationResult, CodeIngestor, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, INTENTS, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, type PairResult, type ProjectionSpec, type ResolvedEntity, ResponseFormatter, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, askGraph, groupNodesByImpact, linkToCode, loadGraph, project, saveGraph };

package/dist/index.d.ts

@@ -244,10 +244,27 @@ declare class ContextQL {
     private readonly store;
     constructor(store: GraphStore);
     execute(params: ContextQLParams): ContextQLResult;
+    private seedRootNodes;
+    private runBFS;
+    private gatherEdges;
 }
 
 declare function project(nodes: readonly GraphNode[], spec: ProjectionSpec | undefined): Partial<GraphNode>[];
 
+interface ImpactGroups {
+    readonly tests: readonly GraphNode[];
+    readonly docs: readonly GraphNode[];
+    readonly code: readonly GraphNode[];
+    readonly other: readonly GraphNode[];
+}
+/**
+ * Group graph nodes into impact categories (tests, docs, code, other).
+ * Excludes the root node from the results.
+ *
+ * Shared by both the NLQ orchestrator and the MCP get_impact handler.
+ */
+declare function groupNodesByImpact(nodes: readonly GraphNode[], excludeId?: string): ImpactGroups;
+
 /**
  * Ingests TypeScript/JavaScript files into the graph via regex-based parsing.
  * Future: upgrade to tree-sitter for full AST parsing.
@@ -256,8 +273,17 @@ declare class CodeIngestor {
     private readonly store;
     constructor(store: GraphStore);
     ingest(rootDir: string): Promise<IngestResult>;
+    private processFile;
+    private trackCallable;
     private findSourceFiles;
     private extractSymbols;
+    private tryExtractFunction;
+    private tryExtractClass;
+    private tryExtractInterface;
+    /** Update brace tracking; returns true when line is consumed (class ended or tracked). */
+    private updateClassContext;
+    private tryExtractMethod;
+    private tryExtractVariable;
     /**
      * Find the closing brace for a construct starting at the given line.
      * Uses a simple brace-counting heuristic. Returns 1-indexed line number.
@@ -371,6 +397,7 @@ declare class JiraConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private processIssue;
 }
 
 declare class SlackConnector implements GraphConnector {
@@ -379,6 +406,7 @@ declare class SlackConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private processChannel;
 }
 
 declare class ConfluenceConnector implements GraphConnector {
@@ -387,6 +415,8 @@ declare class ConfluenceConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllPages;
+    private processPage;
 }
 
 declare class CIConnector implements GraphConnector {
@@ -465,6 +495,10 @@ declare class GraphEntropyAdapter {
      * 3. Unreachable = code nodes NOT in visited set
      */
     computeDeadCodeData(): GraphDeadCodeData;
+    private findEntryPoints;
+    private bfsFromEntryPoints;
+    private enqueueOutboundEdges;
+    private collectUnreachableNodes;
     /**
      * Count all nodes and edges by type.
      */
@@ -495,6 +529,13 @@ declare class GraphComplexityAdapter {
      * 5. Compute 95th percentile
      */
     computeComplexityHotspots(): GraphComplexityResult;
+    /**
+     * Walk the 'contains' edges to find the file node that contains a given function/method.
+     * For methods, walks through the intermediate class node.
+     */
+    private findContainingFileId;
+    private findParentFileOfClass;
+    private getChangeFrequency;
     private computePercentile;
 }
 
@@ -573,6 +614,148 @@ declare class GraphAnomalyAdapter {
     private computeRemovalImpact;
 }
 
+/**
+ * All supported intent categories for natural language graph queries.
+ * Runtime-accessible array mirroring NODE_TYPES / EDGE_TYPES pattern.
+ */
+declare const INTENTS: readonly ["impact", "find", "relationships", "explain", "anomaly"];
+/**
+ * Intent categories for natural language graph queries.
+ */
+type Intent = (typeof INTENTS)[number];
+/**
+ * Result of classifying a natural language question into an intent.
+ */
+interface ClassificationResult {
+    readonly intent: Intent;
+    readonly confidence: number;
+    readonly signals: Readonly<Record<string, number>>;
+}
+/**
+ * An entity mention from the query resolved to a graph node.
+ */
+interface ResolvedEntity {
+    readonly raw: string;
+    readonly nodeId: string;
+    readonly node: GraphNode;
+    readonly confidence: number;
+    readonly method: 'exact' | 'fusion' | 'path';
+}
+/**
+ * Complete result from askGraph, including intent, entities, summary, and raw data.
+ */
+interface AskGraphResult {
+    readonly intent: Intent;
+    readonly intentConfidence: number;
+    readonly entities: readonly ResolvedEntity[];
+    readonly summary: string;
+    readonly data: unknown;
+    readonly suggestions?: readonly string[];
+}
+
+/**
+ * Scored multi-signal intent classifier.
+ *
+ * Combines keyword presence, question-word matching, and verb-pattern matching
+ * to classify natural language questions into one of 5 intents with a confidence
+ * score between 0 and 1.
+ */
+declare class IntentClassifier {
+    /**
+     * Classify a natural language question into an intent.
+     *
+     * @param question - The natural language question to classify
+     * @returns ClassificationResult with intent, confidence, and per-signal scores
+     */
+    classify(question: string): ClassificationResult;
+    /**
+     * Score individual signals for an intent against the normalized query.
+     */
+    private scoreIntent;
+    /**
+     * Score keyword signal: uses word-stem matching (checks if any word in the
+     * query starts with the keyword). Saturates at 2 matches to avoid penalizing
+     * intents with many keywords when only a few appear in the query.
+     */
+    private scoreKeywords;
+    /**
+     * Score question-word signal: 1.0 if the query starts with a matching
+     * question word, 0 otherwise.
+     */
+    private scoreQuestionWord;
+    /**
+     * Score verb-pattern signal: any matching pattern yields a strong score.
+     * Multiple matches increase score but saturate quickly.
+     */
+    private scoreVerbPatterns;
+    /**
+     * Combine individual signal scores into a single confidence score
+     * using additive weighted scoring. Each signal contributes weight * score,
+     * and the total weights sum to 1.0 so the result is naturally bounded [0, 1].
+     */
+    private combineSignals;
+}
+
+declare class EntityExtractor {
+    /**
+     * Extract candidate entity mentions from a natural language query.
+     *
+     * @param query - The natural language query to extract entities from
+     * @returns Array of raw entity strings in priority order, deduplicated
+     */
+    extract(query: string): readonly string[];
+}
+
+/**
+ * Resolves raw entity strings to graph nodes using a 3-step fuzzy cascade:
+ *
+ * 1. Exact name match via store.findNodes({ name })
+ * 2. FusionLayer search (if provided), take top result if score > 0.5
+ * 3. Path match on file nodes via path.includes(raw)
+ *
+ * Each step tags its match with method and confidence.
+ * Unresolved entities are silently omitted from results.
+ */
+declare class EntityResolver {
+    private readonly store;
+    private readonly fusion;
+    constructor(store: GraphStore, fusion?: FusionLayer);
+    /**
+     * Resolve an array of raw entity strings to graph nodes.
+     *
+     * @param raws - Raw entity strings from EntityExtractor
+     * @returns Array of ResolvedEntity for each successfully resolved raw string
+     */
+    resolve(raws: readonly string[]): readonly ResolvedEntity[];
+    private resolveOne;
+}
+
+/**
+ * Template-based response formatter that generates human-readable summaries
+ * from graph operation results, one template per intent.
+ */
+declare class ResponseFormatter {
+    /**
+     * Format graph operation results into a human-readable summary.
+     *
+     * @param intent - The classified intent
+     * @param entities - Resolved entities from the query
+     * @param data - Raw result data (shape varies per intent)
+     * @param query - Original natural language query (optional)
+     * @returns Human-readable summary string
+     */
+    format(intent: Intent, entities: readonly ResolvedEntity[], data: unknown, query?: string): string;
+    private formatImpact;
+    private formatFind;
+    private formatRelationships;
+    private formatExplain;
+    private formatAnomaly;
+    private safeArrayLength;
+    private p;
+}
+
+declare function askGraph(store: GraphStore, question: string): Promise<AskGraphResult>;
+
 interface AssembledContext {
     readonly nodes: readonly GraphNode[];
     readonly edges: readonly GraphEdge[];
@@ -606,6 +789,8 @@ declare class Assembler {
      * Assemble context relevant to an intent string within a token budget.
      */
     assembleContext(intent: string, tokenBudget?: number): AssembledContext;
+    private expandSearchResults;
+    private truncateToFit;
     /**
      * Compute a token budget allocation across node types.
      */
@@ -706,6 +891,80 @@ declare class GraphFeedbackAdapter {
     computeHarnessCheckData(): GraphHarnessCheckData;
 }
 
+interface TaskDefinition {
+    readonly id: string;
+    readonly files: readonly string[];
+}
+interface IndependenceCheckParams {
+    readonly tasks: readonly TaskDefinition[];
+    readonly depth?: number;
+    readonly edgeTypes?: readonly string[];
+}
+interface OverlapDetail {
+    readonly file: string;
+    readonly type: 'direct' | 'transitive';
+    readonly via?: string;
+}
+interface PairResult {
+    readonly taskA: string;
+    readonly taskB: string;
+    readonly independent: boolean;
+    readonly overlaps: readonly OverlapDetail[];
+}
+interface IndependenceResult {
+    readonly tasks: readonly string[];
+    readonly analysisLevel: 'graph-expanded' | 'file-only';
+    readonly depth: number;
+    readonly pairs: readonly PairResult[];
+    readonly groups: readonly (readonly string[])[];
+    readonly verdict: string;
+}
+declare class TaskIndependenceAnalyzer {
+    private readonly store;
+    constructor(store?: GraphStore);
+    analyze(params: IndependenceCheckParams): IndependenceResult;
+    private validate;
+    private expandViaGraph;
+    private computePairOverlap;
+    private buildGroups;
+    private generateVerdict;
+}
+
+type ConflictSeverity = 'high' | 'medium' | 'low';
+interface ConflictDetail {
+    readonly taskA: string;
+    readonly taskB: string;
+    readonly severity: ConflictSeverity;
+    readonly reason: string;
+    readonly mitigation: string;
+    readonly overlaps: readonly OverlapDetail[];
+}
+interface ConflictPrediction {
+    readonly tasks: readonly string[];
+    readonly analysisLevel: 'graph-expanded' | 'file-only';
+    readonly depth: number;
+    readonly conflicts: readonly ConflictDetail[];
+    readonly groups: readonly (readonly string[])[];
+    readonly summary: {
+        readonly high: number;
+        readonly medium: number;
+        readonly low: number;
+        readonly regrouped: boolean;
+    };
+    readonly verdict: string;
+}
+declare class ConflictPredictor {
+    private readonly store;
+    constructor(store?: GraphStore);
+    predict(params: IndependenceCheckParams): ConflictPrediction;
+    private classifyPair;
+    private severityRank;
+    private computePercentile;
+    private buildHighSeverityGroups;
+    private groupsEqual;
+    private generateVerdict;
+}
+
 declare const VERSION = "0.2.0";
 
-export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, CodeIngestor, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, type IngestResult, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type ProjectionSpec, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, linkToCode, loadGraph, project, saveGraph };
+export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, type ClassificationResult, CodeIngestor, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, FusionLayer, type FusionResult, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, GraphStore, type HttpClient, INTENTS, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, type PairResult, type ProjectionSpec, type ResolvedEntity, ResponseFormatter, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TopologicalLinker, VERSION, type VectorSearchResult, VectorStore, askGraph, groupNodesByImpact, linkToCode, loadGraph, project, saveGraph };