@weavelogic/knowledge-graph-agent 0.6.0 → 0.7.1

package/dist/cli/commands/hive-mind/find-connections.js

@@ -0,0 +1,347 @@
+import { Command } from "commander";
+import chalk from "chalk";
+import * as path from "path";
+import { writeFile, readFile } from "fs/promises";
+import { glob } from "fast-glob";
+import matter from "gray-matter";
+function tokenize(text) {
+  const noCode = text.replace(/```[\s\S]*?```/g, "");
+  const noInline = noCode.replace(/`[^`]+`/g, "");
+  const noUrls = noInline.replace(/https?:\/\/[^\s]+/g, "");
+  const noLinks = noUrls.replace(/\[([^\]]+)\]\([^)]+\)/g, "$1");
+  const noWiki = noLinks.replace(/\[\[([^\]|]+)(?:\|[^\]]+)?\]\]/g, "$1");
+  const words = noWiki.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((word) => word.length > 2 && word.length < 30);
+  return words;
+}
+const STOPWORDS = /* @__PURE__ */ new Set([
+  "the",
+  "and",
+  "for",
+  "are",
+  "but",
+  "not",
+  "you",
+  "all",
+  "can",
+  "had",
+  "her",
+  "was",
+  "one",
+  "our",
+  "out",
+  "has",
+  "have",
+  "been",
+  "were",
+  "some",
+  "this",
+  "that",
+  "what",
+  "when",
+  "where",
+  "which",
+  "while",
+  "who",
+  "will",
+  "with",
+  "would",
+  "there",
+  "their",
+  "from",
+  "they",
+  "been",
+  "said",
+  "each",
+  "she",
+  "how",
+  "its",
+  "may",
+  "more",
+  "than",
+  "then",
+  "these",
+  "into",
+  "only",
+  "other",
+  "also",
+  "any",
+  "such",
+  "because",
+  "about",
+  "just",
+  "could",
+  "very"
+]);
+function filterStopwords(words) {
+  return words.filter((word) => !STOPWORDS.has(word));
+}
+class ConnectionFinder {
+  documents = /* @__PURE__ */ new Map();
+  documentVectors = /* @__PURE__ */ new Map();
+  documentFrequency = /* @__PURE__ */ new Map();
+  totalDocuments = 0;
+  /**
+   * Build TF-IDF index from vault
+   */
+  async buildIndex(vaultPath) {
+    const resolvedPath = path.resolve(vaultPath);
+    const files = await glob("**/*.md", {
+      cwd: resolvedPath,
+      ignore: ["node_modules/**", ".git/**", "dist/**"],
+      absolute: false
+    });
+    if (files.length === 0) {
+      throw new Error(`No markdown files found in: ${resolvedPath}`);
+    }
+    this.documents.clear();
+    this.documentVectors.clear();
+    this.documentFrequency.clear();
+    this.totalDocuments = files.length;
+    const termDocuments = /* @__PURE__ */ new Map();
+    for (const file of files) {
+      const filePath = path.join(resolvedPath, file);
+      const content = await readFile(filePath, "utf-8");
+      const { content: bodyContent, data: frontmatter } = matter(content);
+      const fullText = [
+        frontmatter.title || "",
+        frontmatter.description || "",
+        Array.isArray(frontmatter.tags) ? frontmatter.tags.join(" ") : "",
+        Array.isArray(frontmatter.aliases) ? frontmatter.aliases.join(" ") : "",
+        bodyContent
+      ].join(" ");
+      this.documents.set(file, fullText);
+      const tokens = filterStopwords(tokenize(fullText));
+      const uniqueTerms = new Set(tokens);
+      for (const term of uniqueTerms) {
+        if (!termDocuments.has(term)) {
+          termDocuments.set(term, /* @__PURE__ */ new Set());
+        }
+        termDocuments.get(term).add(file);
+      }
+    }
+    for (const [term, docs] of termDocuments) {
+      this.documentFrequency.set(term, docs.size);
+    }
+    for (const file of files) {
+      const content = this.documents.get(file);
+      const tokens = filterStopwords(tokenize(content));
+      const termFreq = /* @__PURE__ */ new Map();
+      for (const term of tokens) {
+        termFreq.set(term, (termFreq.get(term) || 0) + 1);
+      }
+      const tfidf = /* @__PURE__ */ new Map();
+      const maxFreq = Math.max(...termFreq.values(), 1);
+      for (const [term, freq] of termFreq) {
+        const tf = freq / maxFreq;
+        const df = this.documentFrequency.get(term) || 1;
+        const idf = Math.log(this.totalDocuments / df);
+        tfidf.set(term, tf * idf);
+      }
+      let magnitude = 0;
+      for (const value of tfidf.values()) {
+        magnitude += value * value;
+      }
+      magnitude = Math.sqrt(magnitude);
+      this.documentVectors.set(file, {
+        file,
+        terms: tfidf,
+        magnitude
+      });
+    }
+  }
+  /**
+   * Find similar documents to a source file
+   */
+  findSimilar(sourceFile, threshold = 0.3, limit = 10) {
+    const sourceVector = this.documentVectors.get(sourceFile);
+    if (!sourceVector) {
+      return [];
+    }
+    const matches = [];
+    for (const [targetFile, targetVector] of this.documentVectors) {
+      if (targetFile === sourceFile) continue;
+      const similarity = this.cosineSimilarity(sourceVector, targetVector);
+      if (similarity >= threshold) {
+        const sharedTerms = this.findSharedTerms(sourceVector, targetVector);
+        matches.push({
+          source: sourceFile,
+          target: targetFile,
+          similarity: Math.round(similarity * 1e3) / 1e3,
+          sharedTerms: sharedTerms.slice(0, 5)
+        });
+      }
+    }
+    matches.sort((a, b) => b.similarity - a.similarity);
+    return matches.slice(0, limit);
+  }
+  /**
+   * Calculate cosine similarity between two document vectors
+   */
+  cosineSimilarity(a, b) {
+    if (a.magnitude === 0 || b.magnitude === 0) return 0;
+    let dotProduct = 0;
+    for (const [term, aValue] of a.terms) {
+      const bValue = b.terms.get(term) || 0;
+      dotProduct += aValue * bValue;
+    }
+    return dotProduct / (a.magnitude * b.magnitude);
+  }
+  /**
+   * Find shared terms between two documents
+   */
+  findSharedTerms(a, b) {
+    const shared = [];
+    for (const [term, aValue] of a.terms) {
+      const bValue = b.terms.get(term);
+      if (bValue && bValue > 0) {
+        shared.push({ term, score: aValue * bValue });
+      }
+    }
+    shared.sort((a2, b2) => b2.score - a2.score);
+    return shared.map((s) => s.term);
+  }
+  /**
+   * Suggest connections for orphan files
+   */
+  async suggestConnections(vaultPath, orphanFiles, threshold = 0.3, limit = 5) {
+    if (this.documentVectors.size === 0) {
+      await this.buildIndex(vaultPath);
+    }
+    const suggestions = [];
+    for (const orphan of orphanFiles) {
+      const similar = this.findSimilar(orphan, threshold, limit);
+      suggestions.push(...similar);
+    }
+    suggestions.sort((a, b) => b.similarity - a.similarity);
+    return suggestions;
+  }
+  /**
+   * Find all potential connections above threshold
+   */
+  async findAllConnections(vaultPath, threshold = 0.3, limit = 100) {
+    if (this.documentVectors.size === 0) {
+      await this.buildIndex(vaultPath);
+    }
+    const allConnections = [];
+    const processed = /* @__PURE__ */ new Set();
+    for (const sourceFile of this.documentVectors.keys()) {
+      const similar = this.findSimilar(sourceFile, threshold, 10);
+      for (const match of similar) {
+        const key = [match.source, match.target].sort().join("|");
+        if (!processed.has(key)) {
+          processed.add(key);
+          allConnections.push(match);
+        }
+      }
+    }
+    allConnections.sort((a, b) => b.similarity - a.similarity);
+    const topConnections = allConnections.slice(0, limit);
+    const averageSimilarity = topConnections.length > 0 ? topConnections.reduce((sum, c) => sum + c.similarity, 0) / topConnections.length : 0;
+    return {
+      totalDocuments: this.totalDocuments,
+      suggestedConnections: topConnections,
+      orphanConnections: [],
+      termCount: this.documentFrequency.size,
+      averageSimilarity: Math.round(averageSimilarity * 1e3) / 1e3
+    };
+  }
+  /**
+   * Get index statistics
+   */
+  getStats() {
+    return {
+      documents: this.documentVectors.size,
+      terms: this.documentFrequency.size
+    };
+  }
+}
+function createFindConnectionsCommand() {
+  const command = new Command("find-connections").description("Find potential connections using TF-IDF similarity").argument("<vault-path>", "Path to Obsidian vault or docs directory").option("-t, --threshold <number>", "Similarity threshold (0-1)", "0.3").option("-l, --limit <number>", "Maximum connections to return", "50").option("--suggest", "Focus on orphan files").option("-o, --output <file>", "Output file for results").option("--json", "Output as JSON").option("-v, --verbose", "Show detailed output").action(async (vaultPath, options) => {
+    const finder = new ConnectionFinder();
+    const threshold = parseFloat(options.threshold || "0.3");
+    const limit = parseInt(options.limit || "50", 10);
+    console.log(chalk.cyan("\nBuilding TF-IDF index...\n"));
+    try {
+      await finder.buildIndex(vaultPath);
+      const stats = finder.getStats();
+      console.log(chalk.white(`  Documents indexed: ${stats.documents}`));
+      console.log(chalk.white(`  Unique terms:      ${stats.terms}`));
+      console.log("");
+      const result = await finder.findAllConnections(vaultPath, threshold, limit);
+      if (options.json) {
+        if (options.output) {
+          await writeFile(options.output, JSON.stringify(result, null, 2));
+          console.log(chalk.green(`Results written to: ${options.output}`));
+        } else {
+          console.log(JSON.stringify(result, null, 2));
+        }
+      } else {
+        console.log(chalk.bold("Potential Connections Found:\n"));
+        if (result.suggestedConnections.length === 0) {
+          console.log(chalk.yellow("  No connections found above threshold."));
+          console.log(chalk.gray("  Try lowering the threshold with -t option.\n"));
+        } else {
+          for (const conn of result.suggestedConnections.slice(0, options.verbose ? 50 : 20)) {
+            const simColor = conn.similarity >= 0.5 ? chalk.green : conn.similarity >= 0.3 ? chalk.yellow : chalk.gray;
+            console.log(
+              simColor(`  [${(conn.similarity * 100).toFixed(1)}%]`),
+              chalk.white(conn.source),
+              chalk.gray("->"),
+              chalk.cyan(conn.target)
+            );
+            if (options.verbose && conn.sharedTerms.length > 0) {
+              console.log(chalk.gray(`          Terms: ${conn.sharedTerms.join(", ")}`));
+            }
+          }
+          if (result.suggestedConnections.length > (options.verbose ? 50 : 20)) {
+            console.log(
+              chalk.gray(`
+  ... and ${result.suggestedConnections.length - (options.verbose ? 50 : 20)} more`)
+            );
+          }
+          console.log("");
+          console.log(chalk.bold("Summary:"));
+          console.log(chalk.white(`  Total Documents:   ${result.totalDocuments}`));
+          console.log(chalk.white(`  Connections Found: ${result.suggestedConnections.length}`));
+          console.log(chalk.white(`  Average Similarity: ${(result.averageSimilarity * 100).toFixed(1)}%`));
+          console.log("");
+        }
+        if (options.output) {
+          const reportLines = [
+            "# Connection Suggestions\n",
+            `Generated: ${(/* @__PURE__ */ new Date()).toISOString()}
+`,
+            `Threshold: ${threshold}
+`,
+            "",
+            "## Suggested Links\n"
+          ];
+          for (const conn of result.suggestedConnections) {
+            reportLines.push(`- **${conn.source}** -> [[${conn.target}]]`);
+            reportLines.push(`  - Similarity: ${(conn.similarity * 100).toFixed(1)}%`);
+            if (conn.sharedTerms.length > 0) {
+              reportLines.push(`  - Shared terms: ${conn.sharedTerms.join(", ")}`);
+            }
+          }
+          await writeFile(options.output, reportLines.join("\n"));
+          console.log(chalk.green(`Report written to: ${options.output}`));
+        }
+        console.log(chalk.bold("Next Steps:"));
+        console.log(chalk.gray("  1. Review suggested connections"));
+        console.log(chalk.gray("  2. Add [[wiki-links]] to connect related documents"));
+        console.log(chalk.gray("  3. Run kg analyze-links to verify improvement"));
+        console.log("");
+      }
+    } catch (error) {
+      console.error(chalk.red("Error:"), error instanceof Error ? error.message : "Unknown error");
+      process.exit(1);
+    }
+  });
+  return command;
+}
+export {
+  ConnectionFinder,
+  createFindConnectionsCommand,
+  createFindConnectionsCommand as default
+};
+//# sourceMappingURL=find-connections.js.map

package/dist/cli/commands/hive-mind/find-connections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-connections.js","sources":["../../../../src/cli/commands/hive-mind/find-connections.ts"],"sourcesContent":["/**\n * Hive Mind - Connection Finder\n *\n * Uses TF-IDF similarity to find potential connections between documents.\n * Suggests links for orphan files to reconnect the knowledge graph.\n *\n * SPEC-003: Hive Mind Reconnection Tools\n */\n\nimport { Command } from 'commander';\nimport chalk from 'chalk';\nimport * as path from 'path';\nimport { readFile, writeFile } from 'fs/promises';\nimport { glob } from 'fast-glob';\nimport matter from 'gray-matter';\n\n// ============================================================================\n// Types\n// ============================================================================\n\nexport interface FindConnectionsOptions {\n  threshold?: string;\n  suggest?: boolean;\n  limit?: string;\n  output?: string;\n  json?: boolean;\n  verbose?: boolean;\n}\n\nexport interface SimilarityMatch {\n  source: string;\n  target: string;\n  similarity: number;\n  sharedTerms: string[];\n}\n\nexport interface DocumentVector {\n  file: string;\n  terms: Map<string, number>;\n  magnitude: number;\n}\n\nexport interface ConnectionFinderResult {\n  totalDocuments: number;\n  suggestedConnections: SimilarityMatch[];\n  orphanConnections: SimilarityMatch[];\n  termCount: number;\n  averageSimilarity: number;\n}\n\n// ============================================================================\n// TF-IDF Implementation\n// ============================================================================\n\n/**\n * Simple tokenizer - splits text into words\n */\nfunction tokenize(text: string): string[] {\n  // Remove code blocks\n  const noCode = text.replace(/```[\\s\\S]*?```/g, '');\n  // Remove inline code\n  const noInline = noCode.replace(/`[^`]+`/g, '');\n  // Remove URLs\n  const noUrls = noInline.replace(/https?:\\/\\/[^\\s]+/g, '');\n  // Remove markdown links but keep text\n  const noLinks = noUrls.replace(/\\[([^\\]]+)\\]\\([^)]+\\)/g, '$1');\n  // Remove wiki links but keep text\n  const noWiki = noLinks.replace(/\\[\\[([^\\]|]+)(?:\\|[^\\]]+)?\\]\\]/g, '$1');\n  // Remove special characters and split\n  const words = noWiki\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s-]/g, ' ')\n    .split(/\\s+/)\n    .filter(word => word.length > 2 && word.length < 30);\n\n  return words;\n}\n\n/**\n * Stopwords to filter out\n */\nconst STOPWORDS = new Set([\n  'the', 'and', 'for', 'are', 'but', 'not', 'you', 'all', 'can', 'had', 'her',\n  'was', 'one', 'our', 'out', 'has', 'have', 'been', 'were', 'some', 'this',\n  'that', 'what', 'when', 'where', 'which', 'while', 'who', 'will', 'with',\n  'would', 'there', 'their', 'from', 'they', 'been', 'said', 'each', 'she',\n  'how', 'its', 'may', 'more', 'than', 'then', 'these', 'into', 'only',\n  'other', 'also', 'any', 'such', 'because', 'about', 'just', 'could', 'very',\n]);\n\n/**\n * Filter stopwords\n */\nfunction filterStopwords(words: string[]): string[] {\n  return words.filter(word => !STOPWORDS.has(word));\n}\n\n// ============================================================================\n// Connection Finder Class\n// ============================================================================\n\nexport class ConnectionFinder {\n  private documents: Map<string, string> = new Map();\n  private documentVectors: Map<string, DocumentVector> = new Map();\n  private documentFrequency: Map<string, number> = new Map();\n  private totalDocuments = 0;\n\n  /**\n   * Build TF-IDF index from vault\n   */\n  async buildIndex(vaultPath: string): Promise<void> {\n    const resolvedPath = path.resolve(vaultPath);\n\n    // Find all markdown files\n    const files = await glob('**/*.md', {\n      cwd: resolvedPath,\n      ignore: ['node_modules/**', '.git/**', 'dist/**'],\n      absolute: false,\n    });\n\n    if (files.length === 0) {\n      throw new Error(`No markdown files found in: ${resolvedPath}`);\n    }\n\n    this.documents.clear();\n    this.documentVectors.clear();\n    this.documentFrequency.clear();\n    this.totalDocuments = files.length;\n\n    // First pass: calculate document frequency\n    const termDocuments = new Map<string, Set<string>>();\n\n    for (const file of files) {\n      const filePath = path.join(resolvedPath, file);\n      const content = await readFile(filePath, 'utf-8');\n      const { content: bodyContent, data: frontmatter } = matter(content);\n\n      // Combine content with frontmatter fields\n      const fullText = [\n        frontmatter.title || '',\n        frontmatter.description || '',\n        Array.isArray(frontmatter.tags) ? frontmatter.tags.join(' ') : '',\n        Array.isArray(frontmatter.aliases) ? frontmatter.aliases.join(' ') : '',\n        bodyContent,\n      ].join(' ');\n\n      this.documents.set(file, fullText);\n\n      const tokens = filterStopwords(tokenize(fullText));\n      const uniqueTerms = new Set(tokens);\n\n      for (const term of uniqueTerms) {\n        if (!termDocuments.has(term)) {\n          termDocuments.set(term, new Set());\n        }\n        termDocuments.get(term)!.add(file);\n      }\n    }\n\n    // Store document frequency\n    for (const [term, docs] of termDocuments) {\n      this.documentFrequency.set(term, docs.size);\n    }\n\n    // Second pass: calculate TF-IDF vectors\n    for (const file of files) {\n      const content = this.documents.get(file)!;\n      const tokens = filterStopwords(tokenize(content));\n\n      // Calculate term frequency\n      const termFreq = new Map<string, number>();\n      for (const term of tokens) {\n        termFreq.set(term, (termFreq.get(term) || 0) + 1);\n      }\n\n      // Calculate TF-IDF\n      const tfidf = new Map<string, number>();\n      const maxFreq = Math.max(...termFreq.values(), 1);\n\n      for (const [term, freq] of termFreq) {\n        const tf = freq / maxFreq; // Normalized TF\n        const df = this.documentFrequency.get(term) || 1;\n        const idf = Math.log(this.totalDocuments / df);\n        tfidf.set(term, tf * idf);\n      }\n\n      // Calculate magnitude\n      let magnitude = 0;\n      for (const value of tfidf.values()) {\n        magnitude += value * value;\n      }\n      magnitude = Math.sqrt(magnitude);\n\n      this.documentVectors.set(file, {\n        file,\n        terms: tfidf,\n        magnitude,\n      });\n    }\n  }\n\n  /**\n   * Find similar documents to a source file\n   */\n  findSimilar(sourceFile: string, threshold = 0.3, limit = 10): SimilarityMatch[] {\n    const sourceVector = this.documentVectors.get(sourceFile);\n    if (!sourceVector) {\n      return [];\n    }\n\n    const matches: SimilarityMatch[] = [];\n\n    for (const [targetFile, targetVector] of this.documentVectors) {\n      if (targetFile === sourceFile) continue;\n\n      const similarity = this.cosineSimilarity(sourceVector, targetVector);\n\n      if (similarity >= threshold) {\n        const sharedTerms = this.findSharedTerms(sourceVector, targetVector);\n        matches.push({\n          source: sourceFile,\n          target: targetFile,\n          similarity: Math.round(similarity * 1000) / 1000,\n          sharedTerms: sharedTerms.slice(0, 5),\n        });\n      }\n    }\n\n    // Sort by similarity descending\n    matches.sort((a, b) => b.similarity - a.similarity);\n\n    return matches.slice(0, limit);\n  }\n\n  /**\n   * Calculate cosine similarity between two document vectors\n   */\n  private cosineSimilarity(a: DocumentVector, b: DocumentVector): number {\n    if (a.magnitude === 0 || b.magnitude === 0) return 0;\n\n    let dotProduct = 0;\n    for (const [term, aValue] of a.terms) {\n      const bValue = b.terms.get(term) || 0;\n      dotProduct += aValue * bValue;\n    }\n\n    return dotProduct / (a.magnitude * b.magnitude);\n  }\n\n  /**\n   * Find shared terms between two documents\n   */\n  private findSharedTerms(a: DocumentVector, b: DocumentVector): string[] {\n    const shared: Array<{ term: string; score: number }> = [];\n\n    for (const [term, aValue] of a.terms) {\n      const bValue = b.terms.get(term);\n      if (bValue && bValue > 0) {\n        shared.push({ term, score: aValue * bValue });\n      }\n    }\n\n    // Sort by combined score\n    shared.sort((a, b) => b.score - a.score);\n\n    return shared.map(s => s.term);\n  }\n\n  /**\n   * Suggest connections for orphan files\n   */\n  async suggestConnections(\n    vaultPath: string,\n    orphanFiles: string[],\n    threshold = 0.3,\n    limit = 5\n  ): Promise<SimilarityMatch[]> {\n    // Build index if not already built\n    if (this.documentVectors.size === 0) {\n      await this.buildIndex(vaultPath);\n    }\n\n    const suggestions: SimilarityMatch[] = [];\n\n    for (const orphan of orphanFiles) {\n      const similar = this.findSimilar(orphan, threshold, limit);\n      suggestions.push(...similar);\n    }\n\n    // Sort by similarity descending\n    suggestions.sort((a, b) => b.similarity - a.similarity);\n\n    return suggestions;\n  }\n\n  /**\n   * Find all potential connections above threshold\n   */\n  async findAllConnections(\n    vaultPath: string,\n    threshold = 0.3,\n    limit = 100\n  ): Promise<ConnectionFinderResult> {\n    // Build index if not already built\n    if (this.documentVectors.size === 0) {\n      await this.buildIndex(vaultPath);\n    }\n\n    const allConnections: SimilarityMatch[] = [];\n    const processed = new Set<string>();\n\n    for (const sourceFile of this.documentVectors.keys()) {\n      const similar = this.findSimilar(sourceFile, threshold, 10);\n      for (const match of similar) {\n        // Avoid duplicates (A-B and B-A)\n        const key = [match.source, match.target].sort().join('|');\n        if (!processed.has(key)) {\n          processed.add(key);\n          allConnections.push(match);\n        }\n      }\n    }\n\n    // Sort by similarity descending\n    allConnections.sort((a, b) => b.similarity - a.similarity);\n\n    const topConnections = allConnections.slice(0, limit);\n    const averageSimilarity = topConnections.length > 0\n      ? topConnections.reduce((sum, c) => sum + c.similarity, 0) / topConnections.length\n      : 0;\n\n    return {\n      totalDocuments: this.totalDocuments,\n      suggestedConnections: topConnections,\n      orphanConnections: [],\n      termCount: this.documentFrequency.size,\n      averageSimilarity: Math.round(averageSimilarity * 1000) / 1000,\n    };\n  }\n\n  /**\n   * Get index statistics\n   */\n  getStats(): { documents: number; terms: number } {\n    return {\n      documents: this.documentVectors.size,\n      terms: this.documentFrequency.size,\n    };\n  }\n}\n\n// ============================================================================\n// CLI Command\n// ============================================================================\n\nexport function createFindConnectionsCommand(): Command {\n  const command = new Command('find-connections')\n    .description('Find potential connections using TF-IDF similarity')\n    .argument('<vault-path>', 'Path to Obsidian vault or docs directory')\n    .option('-t, --threshold <number>', 'Similarity threshold (0-1)', '0.3')\n    .option('-l, --limit <number>', 'Maximum connections to return', '50')\n    .option('--suggest', 'Focus on orphan files')\n    .option('-o, --output <file>', 'Output file for results')\n    .option('--json', 'Output as JSON')\n    .option('-v, --verbose', 'Show detailed output')\n    .action(async (vaultPath: string, options: FindConnectionsOptions) => {\n      const finder = new ConnectionFinder();\n      const threshold = parseFloat(options.threshold || '0.3');\n      const limit = parseInt(options.limit || '50', 10);\n\n      console.log(chalk.cyan('\\nBuilding TF-IDF index...\\n'));\n\n      try {\n        await finder.buildIndex(vaultPath);\n        const stats = finder.getStats();\n\n        console.log(chalk.white(`  Documents indexed: ${stats.documents}`));\n        console.log(chalk.white(`  Unique terms:      ${stats.terms}`));\n        console.log('');\n\n        const result = await finder.findAllConnections(vaultPath, threshold, limit);\n\n        if (options.json) {\n          if (options.output) {\n            await writeFile(options.output, JSON.stringify(result, null, 2));\n            console.log(chalk.green(`Results written to: ${options.output}`));\n          } else {\n            console.log(JSON.stringify(result, null, 2));\n          }\n        } else {\n          console.log(chalk.bold('Potential Connections Found:\\n'));\n\n          if (result.suggestedConnections.length === 0) {\n            console.log(chalk.yellow('  No connections found above threshold.'));\n            console.log(chalk.gray('  Try lowering the threshold with -t option.\\n'));\n          } else {\n            for (const conn of result.suggestedConnections.slice(0, options.verbose ? 50 : 20)) {\n              const simColor = conn.similarity >= 0.5 ? chalk.green : conn.similarity >= 0.3 ? chalk.yellow : chalk.gray;\n              console.log(\n                simColor(`  [${(conn.similarity * 100).toFixed(1)}%]`),\n                chalk.white(conn.source),\n                chalk.gray('->'),\n                chalk.cyan(conn.target)\n              );\n              if (options.verbose && conn.sharedTerms.length > 0) {\n                console.log(chalk.gray(`          Terms: ${conn.sharedTerms.join(', ')}`));\n              }\n            }\n\n            if (result.suggestedConnections.length > (options.verbose ? 50 : 20)) {\n              console.log(\n                chalk.gray(`\\n  ... and ${result.suggestedConnections.length - (options.verbose ? 50 : 20)} more`)\n              );\n            }\n\n            console.log('');\n            console.log(chalk.bold('Summary:'));\n            console.log(chalk.white(`  Total Documents:   ${result.totalDocuments}`));\n            console.log(chalk.white(`  Connections Found: ${result.suggestedConnections.length}`));\n            console.log(chalk.white(`  Average Similarity: ${(result.averageSimilarity * 100).toFixed(1)}%`));\n            console.log('');\n          }\n\n          // Write to output file if specified\n          if (options.output) {\n            const reportLines = [\n              '# Connection Suggestions\\n',\n              `Generated: ${new Date().toISOString()}\\n`,\n              `Threshold: ${threshold}\\n`,\n              '',\n              '## Suggested Links\\n',\n            ];\n\n            for (const conn of result.suggestedConnections) {\n              reportLines.push(`- **${conn.source}** -> [[${conn.target}]]`);\n              reportLines.push(`  - Similarity: ${(conn.similarity * 100).toFixed(1)}%`);\n              if (conn.sharedTerms.length > 0) {\n                reportLines.push(`  - Shared terms: ${conn.sharedTerms.join(', ')}`);\n              }\n            }\n\n            await writeFile(options.output, reportLines.join('\\n'));\n            console.log(chalk.green(`Report written to: ${options.output}`));\n          }\n\n          // Show next steps\n          console.log(chalk.bold('Next Steps:'));\n          console.log(chalk.gray('  1. Review suggested connections'));\n          console.log(chalk.gray('  2. Add [[wiki-links]] to connect related documents'));\n          console.log(chalk.gray('  3. Run kg analyze-links to verify improvement'));\n          console.log('');\n        }\n      } catch (error) {\n        console.error(chalk.red('Error:'), error instanceof Error ? error.message : 'Unknown error');\n        process.exit(1);\n      }\n    });\n\n  return command;\n}\n\nexport default createFindConnectionsCommand;\n"],"names":["a","b"],"mappings":";;;;;;AAyDA,SAAS,SAAS,MAAwB;AAExC,QAAM,SAAS,KAAK,QAAQ,mBAAmB,EAAE;AAEjD,QAAM,WAAW,OAAO,QAAQ,YAAY,EAAE;AAE9C,QAAM,SAAS,SAAS,QAAQ,sBAAsB,EAAE;AAExD,QAAM,UAAU,OAAO,QAAQ,0BAA0B,IAAI;AAE7D,QAAM,SAAS,QAAQ,QAAQ,mCAAmC,IAAI;AAEtE,QAAM,QAAQ,OACX,YAAA,EACA,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAA,SAAQ,KAAK,SAAS,KAAK,KAAK,SAAS,EAAE;AAErD,SAAO;AACT;AAKA,MAAM,gCAAgB,IAAI;AAAA,EACxB;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACtE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACnE;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClE;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACnE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAC9D;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AACvE,CAAC;AAKD,SAAS,gBAAgB,OAA2B;AAClD,SAAO,MAAM,OAAO,CAAA,SAAQ,CAAC,UAAU,IAAI,IAAI,CAAC;AAClD;AAMO,MAAM,iBAAiB;AAAA,EACpB,gCAAqC,IAAA;AAAA,EACrC,sCAAmD,IAAA;AAAA,EACnD,wCAA6C,IAAA;AAAA,EAC7C,iBAAiB;AAAA;AAAA;AAAA;AAAA,EAKzB,MAAM,WAAW,WAAkC;AACjD,UAAM,eAAe,KAAK,QAAQ,SAAS;AAG3C,UAAM,QAAQ,MAAM,KAAK,WAAW;AAAA,MAClC,KAAK;AAAA,MACL,QAAQ,CAAC,mBAAmB,WAAW,SAAS;AAAA,MAChD,UAAU;AAAA,IAAA,CACX;AAED,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,+BAA+B,YAAY,EAAE;AAAA,IAC/D;AAEA,SAAK,UAAU,MAAA;AACf,SAAK,gBAAgB,MAAA;AACrB,SAAK,kBAAkB,MAAA;AACvB,SAAK,iBAAiB,MAAM;AAG5B,UAAM,oCAAoB,IAAA;AAE1B,eAAW,QAAQ,OAAO;AACxB,YAAM,WAAW,KAAK,KAAK,cAAc,IAAI;AAC7C,YAAM,UAAU,MAAM,SAAS,UAAU,OAAO;AAChD,YAAM,EAAE,SAAS,aAAa,MAAM,YAAA,IAAgB,OAAO,OAAO;AAGlE,YAAM,WAAW;AAAA,QACf,YAAY,SAAS;AAAA,QACrB,YAAY,eAAe;AAAA,QAC3B,MAAM,QAAQ,YAAY,IAAI,IAAI,YAAY,KAAK,KAAK,GAAG,IAAI;AAAA,QAC/D,MAAM,QAAQ,YAAY,OAAO,IAAI,YAAY,QAAQ,KAAK,GAAG,IAAI;AAAA,QACrE;AAAA,MAAA,EACA,KAAK,GAAG;AAEV,WAAK,UAAU,IAAI,MAAM,QAAQ;AAEjC,YAAM,SAAS,gBAAgB,SAAS,QAAQ,CAAC;AACjD,YAAM,cAAc,IAAI,IAAI,MAAM;AAElC,iBAAW,QAAQ,aAAa;AAC9B,YAAI,CAAC,cAAc,IAAI,IAAI,GAAG;AAC5B,wBAAc,IAAI,MAAM,oBAAI,IAAA,CAAK;AAAA,QACnC;AACA,sBAAc,IAAI,IAAI,EAAG,IAAI,IAAI;AAAA,MACnC;AAAA,IACF;AAGA,eAAW,CAAC,MAAM,IAAI,KAAK,eAAe;AACxC,WAAK,kBAAkB,IAAI,MAAM,KAAK,IAAI;AAAA,IAC5C;AAGA,eAAW,QAAQ,OAAO;AACxB,YAAM,UAAU,KAAK,UAAU,IAAI,IAAI;AACvC,YAAM,SAAS,gBAAgB,SAAS,OAAO,CAAC;AAGhD,YAAM,+BAAe,IAAA;AACrB,iBAAW,QAAQ,QAAQ;AACzB,iBAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,MAClD;AAGA,YAAM,4BAAY,IAAA;AAClB,YAAM,UAAU,KAAK,IAAI,GAAG,SAAS,OAAA,GAAU,CAAC;AAEhD,iBAAW,CAAC,MAAM,IAAI,KAAK,UAAU;AACnC,cAAM,KAAK,OAAO;AAClB,cAAM,KAAK,KAAK,kBAAkB,IAAI,IAAI,KAAK;AAC/C,cAAM,MAAM,KAAK,IAAI,KAAK,iBAAiB,EAAE;AAC7C,cAAM,IAAI,MAAM,KAAK,GAAG;AAAA,MAC1B;AAGA,UAAI,YAAY;AAChB,iBAAW,SAAS,MAAM,UAAU;AAClC,qBAAa,QAAQ;AAAA,MACvB;AACA,kBAAY,KAAK,KAAK,SAAS;AAE/B,WAAK,gBAAgB,IAAI,MAAM;AAAA,QAC7B;AAAA,QACA,OAAO;AAAA,QACP;AAAA,MAAA,CACD;AAAA,IACH;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,YAAoB,YAAY,KAAK,QAAQ,IAAuB;AAC9E,UAAM,eAAe,KAAK,gBAAgB,IAAI,UAAU;AACxD,QAAI,CAAC,cAAc;AACjB,aAAO,CAAA;AAAA,IACT;AAEA,UAAM,UAA6B,CAAA;AAEnC,eAAW,CAAC,YAAY,YAAY,KAAK,KAAK,iBAAiB;AAC7D,UAAI,eAAe,WAAY;AAE/B,YAAM,aAAa,KAAK,iBAAiB,cAAc,YAAY;AAEnE,UAAI,cAAc,WAAW;AAC3B,cAAM,cAAc,KAAK,gBAAgB,cAAc,YAAY;AACnE,gBAAQ,KAAK;AAAA,UACX,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,YAAY,KAAK,MAAM,aAAa,GAAI,IAAI;AAAA,UAC5C,aAAa,YAAY,MAAM,GAAG,CAAC;AAAA,QAAA,CACpC;AAAA,MACH;AAAA,IACF;AAGA,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAElD,WAAO,QAAQ,MAAM,GAAG,KAAK;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,GAAmB,GAA2B;AACrE,QAAI,EAAE,cAAc,KAAK,EAAE,cAAc,EAAG,QAAO;AAEnD,QAAI,aAAa;AACjB,eAAW,CAAC,MAAM,MAAM,KAAK,EAAE,OAAO;AACpC,YAAM,SAAS,EAAE,MAAM,IAAI,IAAI,KAAK;AACpC,oBAAc,SAAS;AAAA,IACzB;AAEA,WAAO,cAAc,EAAE,YAAY,EAAE;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,GAAmB,GAA6B;AACtE,UAAM,SAAiD,CAAA;AAEvD,eAAW,CAAC,MAAM,MAAM,KAAK,EAAE,OAAO;AACpC,YAAM,SAAS,EAAE,MAAM,IAAI,IAAI;AAC/B,UAAI,UAAU,SAAS,GAAG;AACxB,eAAO,KAAK,EAAE,MAAM,OAAO,SAAS,QAAQ;AAAA,MAC9C;AAAA,IACF;AAGA,WAAO,KAAK,CAACA,IAAGC,OAAMA,GAAE,QAAQD,GAAE,KAAK;AAEvC,WAAO,OAAO,IAAI,CAAA,MAAK,EAAE,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,mBACJ,WACA,aACA,YAAY,KACZ,QAAQ,GACoB;AAE5B,QAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,YAAM,KAAK,WAAW,SAAS;AAAA,IACjC;AAEA,UAAM,cAAiC,CAAA;AAEvC,eAAW,UAAU,aAAa;AAChC,YAAM,UAAU,KAAK,YAAY,QAAQ,WAAW,KAAK;AACzD,kBAAY,KAAK,GAAG,OAAO;AAAA,IAC7B;AAGA,gBAAY,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAEtD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,mBACJ,WACA,YAAY,KACZ,QAAQ,KACyB;AAEjC,QAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,YAAM,KAAK,WAAW,SAAS;AAAA,IACjC;AAEA,UAAM,iBAAoC,CAAA;AAC1C,UAAM,gCAAgB,IAAA;AAEtB,eAAW,cAAc,KAAK,gBAAgB,KAAA,GAAQ;AACpD,YAAM,UAAU,KAAK,YAAY,YAAY,WAAW,EAAE;AAC1D,iBAAW,SAAS,SAAS;AAE3B,cAAM,MAAM,CAAC,MAAM,QAAQ,MAAM,MAAM,EAAE,KAAA,EAAO,KAAK,GAAG;AACxD,YAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AACvB,oBAAU,IAAI,GAAG;AACjB,yBAAe,KAAK,KAAK;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAGA,mBAAe,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAEzD,UAAM,iBAAiB,eAAe,MAAM,GAAG,KAAK;AACpD,UAAM,oBAAoB,eAAe,SAAS,IAC9C,eAAe,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,YAAY,CAAC,IAAI,eAAe,SAC1E;AAEJ,WAAO;AAAA,MACL,gBAAgB,KAAK;AAAA,MACrB,sBAAsB;AAAA,MACtB,mBAAmB,CAAA;AAAA,MACnB,WAAW,KAAK,kBAAkB;AAAA,MAClC,mBAAmB,KAAK,MAAM,oBAAoB,GAAI,IAAI;AAAA,IAAA;AAAA,EAE9D;AAAA;AAAA;AAAA;AAAA,EAKA,WAAiD;AAC/C,WAAO;AAAA,MACL,WAAW,KAAK,gBAAgB;AAAA,MAChC,OAAO,KAAK,kBAAkB;AAAA,IAAA;AAAA,EAElC;AACF;AAMO,SAAS,+BAAwC;AACtD,QAAM,UAAU,IAAI,QAAQ,kBAAkB,EAC3C,YAAY,oDAAoD,EAChE,SAAS,gBAAgB,0CAA0C,EACnE,OAAO,4BAA4B,8BAA8B,KAAK,EACtE,OAAO,wBAAwB,iCAAiC,IAAI,EACpE,OAAO,aAAa,uBAAuB,EAC3C,OAAO,uBAAuB,yBAAyB,EACvD,OAAO,UAAU,gBAAgB,EACjC,OAAO,iBAAiB,sBAAsB,EAC9C,OAAO,OAAO,WAAmB,YAAoC;AACpE,UAAM,SAAS,IAAI,iBAAA;AACnB,UAAM,YAAY,WAAW,QAAQ,aAAa,KAAK;AACvD,UAAM,QAAQ,SAAS,QAAQ,SAAS,MAAM,EAAE;AAEhD,YAAQ,IAAI,MAAM,KAAK,8BAA8B,CAAC;AAEtD,QAAI;AACF,YAAM,OAAO,WAAW,SAAS;AACjC,YAAM,QAAQ,OAAO,SAAA;AAErB,cAAQ,IAAI,MAAM,MAAM,wBAAwB,MAAM,SAAS,EAAE,CAAC;AAClE,cAAQ,IAAI,MAAM,MAAM,wBAAwB,MAAM,KAAK,EAAE,CAAC;AAC9D,cAAQ,IAAI,EAAE;AAEd,YAAM,SAAS,MAAM,OAAO,mBAAmB,WAAW,WAAW,KAAK;AAE1E,UAAI,QAAQ,MAAM;AAChB,YAAI,QAAQ,QAAQ;AAClB,gBAAM,UAAU,QAAQ,QAAQ,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAC/D,kBAAQ,IAAI,MAAM,MAAM,uBAAuB,QAAQ,MAAM,EAAE,CAAC;AAAA,QAClE,OAAO;AACL,kBAAQ,IAAI,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,QAC7C;AAAA,MACF,OAAO;AACL,gBAAQ,IAAI,MAAM,KAAK,gCAAgC,CAAC;AAExD,YAAI,OAAO,qBAAqB,WAAW,GAAG;AAC5C,kBAAQ,IAAI,MAAM,OAAO,yCAAyC,CAAC;AACnE,kBAAQ,IAAI,MAAM,KAAK,gDAAgD,CAAC;AAAA,QAC1E,OAAO;AACL,qBAAW,QAAQ,OAAO,qBAAqB,MAAM,GAAG,QAAQ,UAAU,KAAK,EAAE,GAAG;AAClF,kBAAM,WAAW,KAAK,cAAc,MAAM,MAAM,QAAQ,KAAK,cAAc,MAAM,MAAM,SAAS,MAAM;AACtG,oBAAQ;AAAA,cACN,SAAS,OAAO,KAAK,aAAa,KAAK,QAAQ,CAAC,CAAC,IAAI;AAAA,cACrD,MAAM,MAAM,KAAK,MAAM;AAAA,cACvB,MAAM,KAAK,IAAI;AAAA,cACf,MAAM,KAAK,KAAK,MAAM;AAAA,YAAA;AAExB,gBAAI,QAAQ,WAAW,KAAK,YAAY,SAAS,GAAG;AAClD,sBAAQ,IAAI,MAAM,KAAK,oBAAoB,KAAK,YAAY,KAAK,IAAI,CAAC,EAAE,CAAC;AAAA,YAC3E;AAAA,UACF;AAEA,cAAI,OAAO,qBAAqB,UAAU,QAAQ,UAAU,KAAK,KAAK;AACpE,oBAAQ;AAAA,cACN,MAAM,KAAK;AAAA,YAAe,OAAO,qBAAqB,UAAU,QAAQ,UAAU,KAAK,GAAG,OAAO;AAAA,YAAA;AAAA,UAErG;AAEA,kBAAQ,IAAI,EAAE;AACd,kBAAQ,IAAI,MAAM,KAAK,UAAU,CAAC;AAClC,kBAAQ,IAAI,MAAM,MAAM,wBAAwB,OAAO,cAAc,EAAE,CAAC;AACxE,kBAAQ,IAAI,MAAM,MAAM,wBAAwB,OAAO,qBAAqB,MAAM,EAAE,CAAC;AACrF,kBAAQ,IAAI,MAAM,MAAM,0BAA0B,OAAO,oBAAoB,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC;AAChG,kBAAQ,IAAI,EAAE;AAAA,QAChB;AAGA,YAAI,QAAQ,QAAQ;AAClB,gBAAM,cAAc;AAAA,YAClB;AAAA,YACA,eAAc,oBAAI,KAAA,GAAO,aAAa;AAAA;AAAA,YACtC,cAAc,SAAS;AAAA;AAAA,YACvB;AAAA,YACA;AAAA,UAAA;AAGF,qBAAW,QAAQ,OAAO,sBAAsB;AAC9C,wBAAY,KAAK,OAAO,KAAK,MAAM,WAAW,KAAK,MAAM,IAAI;AAC7D,wBAAY,KAAK,oBAAoB,KAAK,aAAa,KAAK,QAAQ,CAAC,CAAC,GAAG;AACzE,gBAAI,KAAK,YAAY,SAAS,GAAG;AAC/B,0BAAY,KAAK,qBAAqB,KAAK,YAAY,KAAK,IAAI,CAAC,EAAE;AAAA,YACrE;AAAA,UACF;AAEA,gBAAM,UAAU,QAAQ,QAAQ,YAAY,KAAK,IAAI,CAAC;AACtD,kBAAQ,IAAI,MAAM,MAAM,sBAAsB,QAAQ,MAAM,EAAE,CAAC;AAAA,QACjE;AAGA,gBAAQ,IAAI,MAAM,KAAK,aAAa,CAAC;AACrC,gBAAQ,IAAI,MAAM,KAAK,mCAAmC,CAAC;AAC3D,gBAAQ,IAAI,MAAM,KAAK,sDAAsD,CAAC;AAC9E,gBAAQ,IAAI,MAAM,KAAK,iDAAiD,CAAC;AACzE,gBAAQ,IAAI,EAAE;AAAA,MAChB;AAAA,IACF,SAAS,OAAO;AACd,cAAQ,MAAM,MAAM,IAAI,QAAQ,GAAG,iBAAiB,QAAQ,MAAM,UAAU,eAAe;AAC3F,cAAQ,KAAK,CAAC;AAAA,IAChB;AAAA,EACF,CAAC;AAEH,SAAO;AACT;"}

package/dist/cli/commands/hive-mind/index.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Hive Mind - Knowledge Graph Reconnection Tools
+ *
+ * A suite of CLI tools for analyzing and reconnecting knowledge graphs
+ * to reduce orphan rates and increase link density.
+ *
+ * SPEC-003: Hive Mind Reconnection Tools
+ *
+ * Target Metrics:
+ * - Orphan rate: 88.1% -> < 10%
+ * - Link density: 1.08 -> > 5.0
+ */
+export { LinkAnalyzer } from './analyze-links.js';
+export type { LinkAnalysisResult, BrokenLink, AnalyzeOptions } from './analyze-links.js';
+export { ConnectionFinder } from './find-connections.js';
+export type { ConnectionFinderResult, SimilarityMatch, FindConnectionsOptions } from './find-connections.js';
+export { NameValidator } from './validate-names.js';
+export type { ValidationResult, InvalidFile, NamingSchema, ValidateNamesOptions } from './validate-names.js';
+export { FrontmatterEnricher } from './add-frontmatter.js';
+export type { EnrichResult, EnrichedFile, FrontmatterTemplate, EnrichOptions } from './add-frontmatter.js';
+export { createAnalyzeLinksCommand } from './analyze-links.js';
+export { createFindConnectionsCommand } from './find-connections.js';
+export { createValidateNamesCommand } from './validate-names.js';
+export { createAddFrontmatterCommand } from './add-frontmatter.js';
+import { Command } from 'commander';
+/**
+ * Create the hive-mind command group
+ *
+ * Groups all Hive Mind reconnection tools under a single command namespace:
+ * - kg hive-mind analyze-links <vault>
+ * - kg hive-mind find-connections <vault>
+ * - kg hive-mind validate-names <vault>
+ * - kg hive-mind add-frontmatter <vault>
+ */
+export declare function createHiveMindCommand(): Command;
+export default createHiveMindCommand;
+//# sourceMappingURL=index.d.ts.map

package/dist/cli/commands/hive-mind/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/cli/commands/hive-mind/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,YAAY,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEzF,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,sBAAsB,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAE7G,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,YAAY,EAAE,gBAAgB,EAAE,WAAW,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAE7G,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAC3D,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG3G,OAAO,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AACrE,OAAO,EAAE,0BAA0B,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,EAAE,2BAA2B,EAAE,MAAM,sBAAsB,CAAC;AAEnE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAMpC;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,IAAI,OAAO,CAiB/C;AAED,eAAe,qBAAqB,CAAC"}

package/dist/cli/commands/hive-mind/index.js

@@ -0,0 +1,33 @@
+import { createAnalyzeLinksCommand } from "./analyze-links.js";
+import { LinkAnalyzer } from "./analyze-links.js";
+import { createFindConnectionsCommand } from "./find-connections.js";
+import { ConnectionFinder } from "./find-connections.js";
+import { createValidateNamesCommand } from "./validate-names.js";
+import { NameValidator } from "./validate-names.js";
+import { createAddFrontmatterCommand } from "./add-frontmatter.js";
+import { FrontmatterEnricher } from "./add-frontmatter.js";
+import { Command } from "commander";
+function createHiveMindCommand() {
+  const command = new Command("hive-mind").description("Knowledge graph reconnection tools - reduce orphan rate and increase link density").alias("hm");
+  command.addCommand(createAnalyzeLinksCommand());
+  command.addCommand(createFindConnectionsCommand());
+  command.addCommand(createValidateNamesCommand());
+  command.addCommand(createAddFrontmatterCommand());
+  command.action(() => {
+    command.help();
+  });
+  return command;
+}
+export {
+  ConnectionFinder,
+  FrontmatterEnricher,
+  LinkAnalyzer,
+  NameValidator,
+  createAddFrontmatterCommand,
+  createAnalyzeLinksCommand,
+  createFindConnectionsCommand,
+  createHiveMindCommand,
+  createValidateNamesCommand,
+  createHiveMindCommand as default
+};
+//# sourceMappingURL=index.js.map

package/dist/cli/commands/hive-mind/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../src/cli/commands/hive-mind/index.ts"],"sourcesContent":["/**\n * Hive Mind - Knowledge Graph Reconnection Tools\n *\n * A suite of CLI tools for analyzing and reconnecting knowledge graphs\n * to reduce orphan rates and increase link density.\n *\n * SPEC-003: Hive Mind Reconnection Tools\n *\n * Target Metrics:\n * - Orphan rate: 88.1% -> < 10%\n * - Link density: 1.08 -> > 5.0\n */\n\n// Re-export classes for programmatic use\nexport { LinkAnalyzer } from './analyze-links.js';\nexport type { LinkAnalysisResult, BrokenLink, AnalyzeOptions } from './analyze-links.js';\n\nexport { ConnectionFinder } from './find-connections.js';\nexport type { ConnectionFinderResult, SimilarityMatch, FindConnectionsOptions } from './find-connections.js';\n\nexport { NameValidator } from './validate-names.js';\nexport type { ValidationResult, InvalidFile, NamingSchema, ValidateNamesOptions } from './validate-names.js';\n\nexport { FrontmatterEnricher } from './add-frontmatter.js';\nexport type { EnrichResult, EnrichedFile, FrontmatterTemplate, EnrichOptions } from './add-frontmatter.js';\n\n// Re-export CLI command creators\nexport { createAnalyzeLinksCommand } from './analyze-links.js';\nexport { createFindConnectionsCommand } from './find-connections.js';\nexport { createValidateNamesCommand } from './validate-names.js';\nexport { createAddFrontmatterCommand } from './add-frontmatter.js';\n\nimport { Command } from 'commander';\nimport { createAnalyzeLinksCommand } from './analyze-links.js';\nimport { createFindConnectionsCommand } from './find-connections.js';\nimport { createValidateNamesCommand } from './validate-names.js';\nimport { createAddFrontmatterCommand } from './add-frontmatter.js';\n\n/**\n * Create the hive-mind command group\n *\n * Groups all Hive Mind reconnection tools under a single command namespace:\n * - kg hive-mind analyze-links <vault>\n * - kg hive-mind find-connections <vault>\n * - kg hive-mind validate-names <vault>\n * - kg hive-mind add-frontmatter <vault>\n */\nexport function createHiveMindCommand(): Command {\n  const command = new Command('hive-mind')\n    .description('Knowledge graph reconnection tools - reduce orphan rate and increase link density')\n    .alias('hm');\n\n  // Add subcommands\n  command.addCommand(createAnalyzeLinksCommand());\n  command.addCommand(createFindConnectionsCommand());\n  command.addCommand(createValidateNamesCommand());\n  command.addCommand(createAddFrontmatterCommand());\n\n  // Default action - show help\n  command.action(() => {\n    command.help();\n  });\n\n  return command;\n}\n\nexport default createHiveMindCommand;\n"],"names":["createAnalyzeLinksCommand","createFindConnectionsCommand","createValidateNamesCommand","createAddFrontmatterCommand"],"mappings":";;;;;;;;;AA+CO,SAAS,wBAAiC;AAC/C,QAAM,UAAU,IAAI,QAAQ,WAAW,EACpC,YAAY,mFAAmF,EAC/F,MAAM,IAAI;AAGb,UAAQ,WAAWA,2BAA2B;AAC9C,UAAQ,WAAWC,8BAA8B;AACjD,UAAQ,WAAWC,4BAA4B;AAC/C,UAAQ,WAAWC,6BAA6B;AAGhD,UAAQ,OAAO,MAAM;AACnB,YAAQ,KAAA;AAAA,EACV,CAAC;AAED,SAAO;AACT;"}

package/dist/cli/commands/hive-mind/validate-names.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Hive Mind - Name Validator
+ *
+ * Validates file naming schema in a vault to ensure consistent, linkable names.
+ * Supports kebab-case, lowercase, and other naming conventions.
+ *
+ * SPEC-003: Hive Mind Reconnection Tools
+ */
+import { Command } from 'commander';
+export interface ValidateNamesOptions {
+    fix?: boolean;
+    dryRun?: boolean;
+    schema?: string;
+    output?: string;
+    json?: boolean;
+    verbose?: boolean;
+}
+export interface InvalidFile {
+    file: string;
+    issues: string[];
+    suggested: string;
+}
+export interface ValidationResult {
+    valid: string[];
+    invalid: InvalidFile[];
+    statistics: {
+        totalFiles: number;
+        validCount: number;
+        invalidCount: number;
+        commonIssues: Map<string, number>;
+    };
+}
+export interface NamingSchema {
+    name: string;
+    patterns: {
+        lowercase: boolean;
+        separator: '-' | '_' | '.';
+        maxLength: number;
+        allowedChars: RegExp;
+        reservedNames: string[];
+        allowMixedSeparators?: boolean;
+    };
+}
+export declare class NameValidator {
+    private schema;
+    constructor(schemaName?: string);
+    /**
+     * Validate all files in a vault
+     */
+    validateVault(vaultPath: string, options?: ValidateNamesOptions): Promise<ValidationResult>;
+    /**
+     * Validate a single filename
+     */
+    validateFilename(filename: string): string[];
+    /**
+     * Suggest a valid filename
+     */
+    suggestRename(filename: string): string;
+    /**
+     * Rename files (with safety checks)
+     */
+    renameFiles(vaultPath: string, invalidFiles: InvalidFile[], dryRun?: boolean): Promise<Array<{
+        from: string;
+        to: string;
+        success: boolean;
+        error?: string;
+    }>>;
+    /**
+     * Get current schema
+     */
+    getSchema(): NamingSchema;
+    /**
+     * Generate report
+     */
+    generateReport(result: ValidationResult): string;
+}
+export declare function createValidateNamesCommand(): Command;
+export default createValidateNamesCommand;
+//# sourceMappingURL=validate-names.d.ts.map

package/dist/cli/commands/hive-mind/validate-names.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-names.d.ts","sourceRoot":"","sources":["../../../../src/cli/commands/hive-mind/validate-names.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAUpC,MAAM,WAAW,oBAAoB;IACnC,GAAG,CAAC,EAAE,OAAO,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB,UAAU,EAAE;QACV,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACnC,CAAC;CACH;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE;QACR,SAAS,EAAE,OAAO,CAAC;QACnB,SAAS,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;QAC3B,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,EAAE,CAAC;QACxB,oBAAoB,CAAC,EAAE,OAAO,CAAC;KAChC,CAAC;CACH;AA4CD,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAe;gBAEjB,UAAU,SAAU;IAIhC;;OAEG;IACG,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,oBAAyB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAoDrG;;OAEG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAyD5C;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IA2CvC;;OAEG;IACG,WAAW,CACf,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,WAAW,EAAE,EAC3B,MAAM,UAAQ,GACb,OAAO,CAAC,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAoDjF;;OAEG;IACH,SAAS,IAAI,YAAY;IAIzB;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,gBAAgB,GAAG,MAAM;CAyCjD;AAMD,wBAAgB,0BAA0B,IAAI,OAAO,CA6HpD;AAED,eAAe,0BAA0B,CAAC"}