@weavelogic/knowledge-graph-agent 0.1.0

package/dist/core/database.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"database.js","sources":["../../src/core/database.ts"],"sourcesContent":["/**\n * Knowledge Graph Database\n *\n * SQLite database for persistent storage of knowledge graph data.\n * Compatible with claude-flow database patterns.\n */\n\nimport Database from 'better-sqlite3';\nimport { existsSync, mkdirSync } from 'fs';\nimport { dirname } from 'path';\nimport type {\n  KnowledgeNode,\n  GraphEdge,\n  GraphStats,\n  NodeType,\n  NodeStatus,\n} from './types.js';\n\n/**\n * Safely parse JSON with fallback\n * Prevents error leakage from malformed JSON\n */\nfunction safeJsonParse<T>(str: string | null | undefined, fallback: T): T {\n  if (!str) return fallback;\n  try {\n    return JSON.parse(str) as T;\n  } catch {\n    return fallback;\n  }\n}\n\nconst SCHEMA_SQL = `\n-- Knowledge Graph Schema v1.0\n\n-- Nodes table\nCREATE TABLE IF NOT EXISTS nodes (\n  id TEXT PRIMARY KEY,\n  path TEXT NOT NULL UNIQUE,\n  filename TEXT NOT NULL,\n  title TEXT NOT NULL,\n  type TEXT NOT NULL CHECK(type IN ('concept', 'technical', 'feature', 'primitive', 'service', 'guide', 'standard', 'integration')),\n  status TEXT NOT NULL DEFAULT 'active' CHECK(status IN ('draft', 'active', 'deprecated', 'archived')),\n  content TEXT,\n  frontmatter TEXT,\n  word_count INTEGER DEFAULT 0,\n  created_at TEXT NOT NULL DEFAULT (datetime('now')),\n  updated_at TEXT NOT NULL DEFAULT (datetime('now'))\n);\n\n-- Tags table\nCREATE TABLE IF NOT EXISTS tags (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  name TEXT NOT NULL UNIQUE\n);\n\n-- Node-Tags junction table\nCREATE TABLE IF NOT EXISTS node_tags (\n  node_id TEXT NOT NULL,\n  tag_id INTEGER NOT NULL,\n  PRIMARY KEY (node_id, tag_id),\n  FOREIGN KEY (node_id) REFERENCES nodes(id) ON DELETE CASCADE,\n  FOREIGN KEY (tag_id) REFERENCES tags(id) ON DELETE CASCADE\n);\n\n-- Edges table\nCREATE TABLE IF NOT EXISTS edges (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  source_id TEXT NOT NULL,\n  target_id TEXT NOT NULL,\n  type TEXT NOT NULL CHECK(type IN ('link', 'reference', 'parent', 'related')),\n  weight REAL DEFAULT 1.0,\n  context TEXT,\n  created_at TEXT NOT NULL DEFAULT (datetime('now')),\n  FOREIGN KEY (source_id) REFERENCES nodes(id) ON DELETE CASCADE\n);\n\n-- Metadata table\nCREATE TABLE IF NOT EXISTS metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT,\n  updated_at TEXT NOT NULL DEFAULT (datetime('now'))\n);\n\n-- Indexes for performance\nCREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);\nCREATE INDEX IF NOT EXISTS idx_nodes_status ON nodes(status);\nCREATE INDEX IF NOT EXISTS idx_nodes_path ON nodes(path);\nCREATE INDEX IF NOT EXISTS idx_edges_source ON edges(source_id);\nCREATE INDEX IF NOT EXISTS idx_edges_target ON edges(target_id);\nCREATE INDEX IF NOT EXISTS idx_node_tags_node ON node_tags(node_id);\nCREATE INDEX IF NOT EXISTS idx_node_tags_tag ON node_tags(tag_id);\n\n-- Full-text search\nCREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(\n  title,\n  content,\n  content='nodes',\n  content_rowid='rowid'\n);\n\n-- Triggers for FTS sync\nCREATE TRIGGER IF NOT EXISTS nodes_ai AFTER INSERT ON nodes BEGIN\n  INSERT INTO nodes_fts(rowid, title, content) VALUES (NEW.rowid, NEW.title, NEW.content);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS nodes_ad AFTER DELETE ON nodes BEGIN\n  INSERT INTO nodes_fts(nodes_fts, rowid, title, content) VALUES('delete', OLD.rowid, OLD.title, OLD.content);\nEND;\n\nCREATE TRIGGER IF NOT EXISTS nodes_au AFTER UPDATE ON nodes BEGIN\n  INSERT INTO nodes_fts(nodes_fts, rowid, title, content) VALUES('delete', OLD.rowid, OLD.title, OLD.content);\n  INSERT INTO nodes_fts(rowid, title, content) VALUES (NEW.rowid, NEW.title, NEW.content);\nEND;\n\n-- Initialize metadata\nINSERT OR IGNORE INTO metadata (key, value) VALUES ('version', '1.0.0');\nINSERT OR IGNORE INTO metadata (key, value) VALUES ('created', datetime('now'));\n`;\n\n/**\n * Knowledge Graph Database\n */\nexport class KnowledgeGraphDatabase {\n  private db: Database.Database;\n  private dbPath: string;\n\n  constructor(dbPath: string) {\n    this.dbPath = dbPath;\n\n    // Ensure directory exists\n    const dir = dirname(dbPath);\n    if (!existsSync(dir)) {\n      mkdirSync(dir, { recursive: true });\n    }\n\n    // Open database\n    this.db = new Database(dbPath);\n    this.db.pragma('journal_mode = WAL');\n    this.db.pragma('foreign_keys = ON');\n    this.db.pragma('busy_timeout = 5000');\n\n    // Initialize schema\n    this.db.exec(SCHEMA_SQL);\n  }\n\n  // ========================================================================\n  // Node Operations\n  // ========================================================================\n\n  /**\n   * Insert or update a node\n   */\n  upsertNode(node: KnowledgeNode): void {\n    const stmt = this.db.prepare(`\n      INSERT INTO nodes (id, path, filename, title, type, status, content, frontmatter, word_count, updated_at)\n      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, datetime('now'))\n      ON CONFLICT(id) DO UPDATE SET\n        path = excluded.path,\n        filename = excluded.filename,\n        title = excluded.title,\n        type = excluded.type,\n        status = excluded.status,\n        content = excluded.content,\n        frontmatter = excluded.frontmatter,\n        word_count = excluded.word_count,\n        updated_at = datetime('now')\n    `);\n\n    stmt.run(\n      node.id,\n      node.path,\n      node.filename,\n      node.title,\n      node.type,\n      node.status,\n      node.content,\n      JSON.stringify(node.frontmatter),\n      node.wordCount\n    );\n\n    // Update tags\n    this.updateNodeTags(node.id, node.tags);\n  }\n\n  /**\n   * Get node by ID\n   */\n  getNode(id: string): KnowledgeNode | null {\n    const stmt = this.db.prepare('SELECT * FROM nodes WHERE id = ?');\n    const row = stmt.get(id) as NodeRow | undefined;\n    if (!row) return null;\n    return this.rowToNode(row);\n  }\n\n  /**\n   * Get node by path\n   */\n  getNodeByPath(path: string): KnowledgeNode | null {\n    const stmt = this.db.prepare('SELECT * FROM nodes WHERE path = ?');\n    const row = stmt.get(path) as NodeRow | undefined;\n    if (!row) return null;\n    return this.rowToNode(row);\n  }\n\n  /**\n   * Get all nodes\n   */\n  getAllNodes(): KnowledgeNode[] {\n    const stmt = this.db.prepare('SELECT * FROM nodes ORDER BY title');\n    const rows = stmt.all() as NodeRow[];\n    return rows.map(row => this.rowToNode(row));\n  }\n\n  /**\n   * Get nodes by type\n   */\n  getNodesByType(type: NodeType): KnowledgeNode[] {\n    const stmt = this.db.prepare('SELECT * FROM nodes WHERE type = ? ORDER BY title');\n    const rows = stmt.all(type) as NodeRow[];\n    return rows.map(row => this.rowToNode(row));\n  }\n\n  /**\n   * Get nodes by status\n   */\n  getNodesByStatus(status: NodeStatus): KnowledgeNode[] {\n    const stmt = this.db.prepare('SELECT * FROM nodes WHERE status = ? ORDER BY title');\n    const rows = stmt.all(status) as NodeRow[];\n    return rows.map(row => this.rowToNode(row));\n  }\n\n  /**\n   * Get nodes by tag\n   */\n  getNodesByTag(tag: string): KnowledgeNode[] {\n    const stmt = this.db.prepare(`\n      SELECT n.* FROM nodes n\n      JOIN node_tags nt ON n.id = nt.node_id\n      JOIN tags t ON nt.tag_id = t.id\n      WHERE t.name = ?\n      ORDER BY n.title\n    `);\n    const rows = stmt.all(tag) as NodeRow[];\n    return rows.map(row => this.rowToNode(row));\n  }\n\n  /**\n   * Sanitize FTS5 query to prevent query injection\n   * Escapes special FTS5 operators and quotes terms\n   */\n  private sanitizeFtsQuery(query: string): string {\n    if (!query || typeof query !== 'string') return '';\n\n    // Remove FTS5 special operators: * \" ( ) : ^ - AND OR NOT NEAR\n    const sanitized = query\n      .replace(/[*\"():^\\-]/g, ' ')  // Remove special chars\n      .replace(/\\b(AND|OR|NOT|NEAR)\\b/gi, '') // Remove boolean operators\n      .trim()\n      .split(/\\s+/)\n      .filter(term => term.length > 0 && term.length < 100) // Limit term length\n      .slice(0, 20)  // Limit number of terms\n      .map(term => `\"${term.replace(/\"/g, '')}\"`)  // Quote each term safely\n      .join(' ');\n\n    return sanitized;\n  }\n\n  /**\n   * Search nodes by title or content\n   */\n  searchNodes(query: string, limit = 50): KnowledgeNode[] {\n    const sanitizedQuery = this.sanitizeFtsQuery(query);\n\n    // Return empty if no valid search terms\n    if (!sanitizedQuery) {\n      return [];\n    }\n\n    // Enforce reasonable limit\n    const safeLimit = Math.min(Math.max(1, limit), 100);\n\n    const stmt = this.db.prepare(`\n      SELECT n.* FROM nodes n\n      JOIN nodes_fts fts ON n.rowid = fts.rowid\n      WHERE nodes_fts MATCH ?\n      ORDER BY rank\n      LIMIT ?\n    `);\n    const rows = stmt.all(sanitizedQuery, safeLimit) as NodeRow[];\n    return rows.map(row => this.rowToNode(row));\n  }\n\n  /**\n   * Delete node\n   */\n  deleteNode(id: string): boolean {\n    const stmt = this.db.prepare('DELETE FROM nodes WHERE id = ?');\n    const result = stmt.run(id);\n    return result.changes > 0;\n  }\n\n  // ========================================================================\n  // Tag Operations\n  // ========================================================================\n\n  /**\n   * Update tags for a node\n   */\n  private updateNodeTags(nodeId: string, tags: string[]): void {\n    // Remove existing tags\n    this.db.prepare('DELETE FROM node_tags WHERE node_id = ?').run(nodeId);\n\n    // Insert new tags\n    const getOrCreateTag = this.db.prepare(`\n      INSERT INTO tags (name) VALUES (?)\n      ON CONFLICT(name) DO UPDATE SET name = excluded.name\n      RETURNING id\n    `);\n\n    const insertNodeTag = this.db.prepare(\n      'INSERT OR IGNORE INTO node_tags (node_id, tag_id) VALUES (?, ?)'\n    );\n\n    for (const tag of tags) {\n      const result = getOrCreateTag.get(tag) as { id: number };\n      insertNodeTag.run(nodeId, result.id);\n    }\n  }\n\n  /**\n   * Get tags for a node\n   */\n  getNodeTags(nodeId: string): string[] {\n    const stmt = this.db.prepare(`\n      SELECT t.name FROM tags t\n      JOIN node_tags nt ON t.id = nt.tag_id\n      WHERE nt.node_id = ?\n      ORDER BY t.name\n    `);\n    const rows = stmt.all(nodeId) as Array<{ name: string }>;\n    return rows.map(r => r.name);\n  }\n\n  /**\n   * Get all tags with counts\n   */\n  getAllTags(): Array<{ name: string; count: number }> {\n    const stmt = this.db.prepare(`\n      SELECT t.name, COUNT(nt.node_id) as count\n      FROM tags t\n      LEFT JOIN node_tags nt ON t.id = nt.tag_id\n      GROUP BY t.id\n      ORDER BY count DESC, t.name\n    `);\n    return stmt.all() as Array<{ name: string; count: number }>;\n  }\n\n  // ========================================================================\n  // Edge Operations\n  // ========================================================================\n\n  /**\n   * Add edge\n   */\n  addEdge(edge: GraphEdge): void {\n    const stmt = this.db.prepare(`\n      INSERT INTO edges (source_id, target_id, type, weight, context)\n      VALUES (?, ?, ?, ?, ?)\n    `);\n    stmt.run(edge.source, edge.target, edge.type, edge.weight, edge.context);\n  }\n\n  /**\n   * Get outgoing edges for a node\n   */\n  getOutgoingEdges(nodeId: string): GraphEdge[] {\n    const stmt = this.db.prepare('SELECT * FROM edges WHERE source_id = ?');\n    const rows = stmt.all(nodeId) as EdgeRow[];\n    return rows.map(row => this.rowToEdge(row));\n  }\n\n  /**\n   * Get incoming edges for a node\n   */\n  getIncomingEdges(nodeId: string): GraphEdge[] {\n    const stmt = this.db.prepare('SELECT * FROM edges WHERE target_id = ?');\n    const rows = stmt.all(nodeId) as EdgeRow[];\n    return rows.map(row => this.rowToEdge(row));\n  }\n\n  /**\n   * Delete edges for a node\n   */\n  deleteNodeEdges(nodeId: string): void {\n    this.db.prepare('DELETE FROM edges WHERE source_id = ?').run(nodeId);\n  }\n\n  // ========================================================================\n  // Statistics\n  // ========================================================================\n\n  /**\n   * Get graph statistics\n   */\n  getStats(): GraphStats {\n    const totalNodes = (this.db.prepare('SELECT COUNT(*) as count FROM nodes').get() as { count: number }).count;\n    const totalEdges = (this.db.prepare('SELECT COUNT(*) as count FROM edges').get() as { count: number }).count;\n\n    const typeStats = this.db.prepare(`\n      SELECT type, COUNT(*) as count FROM nodes GROUP BY type\n    `).all() as Array<{ type: NodeType; count: number }>;\n\n    const statusStats = this.db.prepare(`\n      SELECT status, COUNT(*) as count FROM nodes GROUP BY status\n    `).all() as Array<{ status: NodeStatus; count: number }>;\n\n    const nodesByType: Record<NodeType, number> = {\n      concept: 0, technical: 0, feature: 0, primitive: 0,\n      service: 0, guide: 0, standard: 0, integration: 0,\n    };\n    for (const { type, count } of typeStats) {\n      nodesByType[type] = count;\n    }\n\n    const nodesByStatus: Record<NodeStatus, number> = {\n      draft: 0, active: 0, deprecated: 0, archived: 0,\n    };\n    for (const { status, count } of statusStats) {\n      nodesByStatus[status] = count;\n    }\n\n    const orphanNodes = (this.db.prepare(`\n      SELECT COUNT(*) as count FROM nodes n\n      WHERE NOT EXISTS (SELECT 1 FROM edges e WHERE e.source_id = n.id OR e.target_id = n.id)\n    `).get() as { count: number }).count;\n\n    const avgLinksPerNode = totalNodes > 0 ? totalEdges / totalNodes : 0;\n\n    const mostConnected = this.db.prepare(`\n      SELECT n.id, (\n        (SELECT COUNT(*) FROM edges WHERE source_id = n.id) +\n        (SELECT COUNT(*) FROM edges WHERE target_id = n.id)\n      ) as connections\n      FROM nodes n\n      ORDER BY connections DESC\n      LIMIT 5\n    `).all() as Array<{ id: string; connections: number }>;\n\n    return {\n      totalNodes,\n      totalEdges,\n      nodesByType,\n      nodesByStatus,\n      orphanNodes,\n      avgLinksPerNode: Math.round(avgLinksPerNode * 100) / 100,\n      mostConnected,\n    };\n  }\n\n  // ========================================================================\n  // Metadata Operations\n  // ========================================================================\n\n  /**\n   * Get metadata value\n   */\n  getMetadata(key: string): string | null {\n    const stmt = this.db.prepare('SELECT value FROM metadata WHERE key = ?');\n    const row = stmt.get(key) as { value: string } | undefined;\n    return row?.value ?? null;\n  }\n\n  /**\n   * Set metadata value\n   */\n  setMetadata(key: string, value: string): void {\n    const stmt = this.db.prepare(`\n      INSERT INTO metadata (key, value, updated_at) VALUES (?, ?, datetime('now'))\n      ON CONFLICT(key) DO UPDATE SET value = excluded.value, updated_at = datetime('now')\n    `);\n    stmt.run(key, value);\n  }\n\n  // ========================================================================\n  // Utilities\n  // ========================================================================\n\n  /**\n   * Convert database row to KnowledgeNode\n   */\n  private rowToNode(row: NodeRow): KnowledgeNode {\n    const tags = this.getNodeTags(row.id);\n    const outgoingEdges = this.getOutgoingEdges(row.id);\n    const incomingEdges = this.getIncomingEdges(row.id);\n\n    return {\n      id: row.id,\n      path: row.path,\n      filename: row.filename,\n      title: row.title,\n      type: row.type as NodeType,\n      status: row.status as NodeStatus,\n      content: row.content || '',\n      frontmatter: safeJsonParse(row.frontmatter, {}),\n      tags,\n      outgoingLinks: outgoingEdges.map(e => ({\n        target: e.target,\n        type: 'wikilink' as const,\n        context: e.context,\n      })),\n      incomingLinks: incomingEdges.map(e => ({\n        target: e.source,\n        type: 'backlink' as const,\n        context: e.context,\n      })),\n      wordCount: row.word_count,\n      lastModified: new Date(row.updated_at),\n    };\n  }\n\n  /**\n   * Convert database row to GraphEdge\n   */\n  private rowToEdge(row: EdgeRow): GraphEdge {\n    return {\n      source: row.source_id,\n      target: row.target_id,\n      type: row.type as GraphEdge['type'],\n      weight: row.weight,\n      context: row.context ?? undefined,\n    };\n  }\n\n  /**\n   * Close database connection\n   */\n  close(): void {\n    this.db.close();\n  }\n\n  /**\n   * Get raw database instance\n   */\n  getDatabase(): Database.Database {\n    return this.db;\n  }\n}\n\n// Row types for database queries\ninterface NodeRow {\n  id: string;\n  path: string;\n  filename: string;\n  title: string;\n  type: string;\n  status: string;\n  content: string | null;\n  frontmatter: string | null;\n  word_count: number;\n  created_at: string;\n  updated_at: string;\n}\n\ninterface EdgeRow {\n  id: number;\n  source_id: string;\n  target_id: string;\n  type: string;\n  weight: number;\n  context: string | null;\n  created_at: string;\n}\n\n/**\n * Create knowledge graph database instance\n */\nexport function createDatabase(dbPath: string): KnowledgeGraphDatabase {\n  return new KnowledgeGraphDatabase(dbPath);\n}\n"],"names":[],"mappings":";;;AAsBA,SAAS,cAAiB,KAAgC,UAAgB;AACxE,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,MAAM,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA2FZ,MAAM,uBAAuB;AAAA,EAC1B;AAAA,EACA;AAAA,EAER,YAAY,QAAgB;AAC1B,SAAK,SAAS;AAGd,UAAM,MAAM,QAAQ,MAAM;AAC1B,QAAI,CAAC,WAAW,GAAG,GAAG;AACpB,gBAAU,KAAK,EAAE,WAAW,KAAA,CAAM;AAAA,IACpC;AAGA,SAAK,KAAK,IAAI,SAAS,MAAM;AAC7B,SAAK,GAAG,OAAO,oBAAoB;AACnC,SAAK,GAAG,OAAO,mBAAmB;AAClC,SAAK,GAAG,OAAO,qBAAqB;AAGpC,SAAK,GAAG,KAAK,UAAU;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW,MAA2B;AACpC,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAa5B;AAED,SAAK;AAAA,MACH,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,UAAU,KAAK,WAAW;AAAA,MAC/B,KAAK;AAAA,IAAA;AAIP,SAAK,eAAe,KAAK,IAAI,KAAK,IAAI;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAkC;AACxC,UAAM,OAAO,KAAK,GAAG,QAAQ,kCAAkC;AAC/D,UAAM,MAAM,KAAK,IAAI,EAAE;AACvB,QAAI,CAAC,IAAK,QAAO;AACjB,WAAO,KAAK,UAAU,GAAG;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,MAAoC;AAChD,UAAM,OAAO,KAAK,GAAG,QAAQ,oCAAoC;AACjE,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAI,CAAC,IAAK,QAAO;AACjB,WAAO,KAAK,UAAU,GAAG;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,cAA+B;AAC7B,UAAM,OAAO,KAAK,GAAG,QAAQ,oCAAoC;AACjE,UAAM,OAAO,KAAK,IAAA;AAClB,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe,MAAiC;AAC9C,UAAM,OAAO,KAAK,GAAG,QAAQ,mDAAmD;AAChF,UAAM,OAAO,KAAK,IAAI,IAAI;AAC1B,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAAqC;AACpD,UAAM,OAAO,KAAK,GAAG,QAAQ,qDAAqD;AAClF,UAAM,OAAO,KAAK,IAAI,MAAM;AAC5B,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,KAA8B;AAC1C,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAM5B;AACD,UAAM,OAAO,KAAK,IAAI,GAAG;AACzB,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAiB,OAAuB;AAC9C,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAGhD,UAAM,YAAY,MACf,QAAQ,eAAe,GAAG,EAC1B,QAAQ,2BAA2B,EAAE,EACrC,OACA,MAAM,KAAK,EACX,OAAO,UAAQ,KAAK,SAAS,KAAK,KAAK,SAAS,GAAG,EACnD,MAAM,GAAG,EAAE,EACX,IAAI,CAAA,SAAQ,IAAI,KAAK,QAAQ,MAAM,EAAE,CAAC,GAAG,EACzC,KAAK,GAAG;AAEX,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,OAAe,QAAQ,IAAqB;AACtD,UAAM,iBAAiB,KAAK,iBAAiB,KAAK;AAGlD,QAAI,CAAC,gBAAgB;AACnB,aAAO,CAAA;AAAA,IACT;AAGA,UAAM,YAAY,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,GAAG,GAAG;AAElD,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAM5B;AACD,UAAM,OAAO,KAAK,IAAI,gBAAgB,SAAS;AAC/C,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,IAAqB;AAC9B,UAAM,OAAO,KAAK,GAAG,QAAQ,gCAAgC;AAC7D,UAAM,SAAS,KAAK,IAAI,EAAE;AAC1B,WAAO,OAAO,UAAU;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,eAAe,QAAgB,MAAsB;AAE3D,SAAK,GAAG,QAAQ,yCAAyC,EAAE,IAAI,MAAM;AAGrE,UAAM,iBAAiB,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA,KAItC;AAED,UAAM,gBAAgB,KAAK,GAAG;AAAA,MAC5B;AAAA,IAAA;AAGF,eAAW,OAAO,MAAM;AACtB,YAAM,SAAS,eAAe,IAAI,GAAG;AACrC,oBAAc,IAAI,QAAQ,OAAO,EAAE;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAA0B;AACpC,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,KAK5B;AACD,UAAM,OAAO,KAAK,IAAI,MAAM;AAC5B,WAAO,KAAK,IAAI,CAAA,MAAK,EAAE,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,aAAqD;AACnD,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAM5B;AACD,WAAO,KAAK,IAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,MAAuB;AAC7B,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA,KAG5B;AACD,SAAK,IAAI,KAAK,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,QAAQ,KAAK,OAAO;AAAA,EACzE;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAA6B;AAC5C,UAAM,OAAO,KAAK,GAAG,QAAQ,yCAAyC;AACtE,UAAM,OAAO,KAAK,IAAI,MAAM;AAC5B,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAA6B;AAC5C,UAAM,OAAO,KAAK,GAAG,QAAQ,yCAAyC;AACtE,UAAM,OAAO,KAAK,IAAI,MAAM;AAC5B,WAAO,KAAK,IAAI,CAAA,QAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB,QAAsB;AACpC,SAAK,GAAG,QAAQ,uCAAuC,EAAE,IAAI,MAAM;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAuB;AACrB,UAAM,aAAc,KAAK,GAAG,QAAQ,qCAAqC,EAAE,MAA4B;AACvG,UAAM,aAAc,KAAK,GAAG,QAAQ,qCAAqC,EAAE,MAA4B;AAEvG,UAAM,YAAY,KAAK,GAAG,QAAQ;AAAA;AAAA,KAEjC,EAAE,IAAA;AAEH,UAAM,cAAc,KAAK,GAAG,QAAQ;AAAA;AAAA,KAEnC,EAAE,IAAA;AAEH,UAAM,cAAwC;AAAA,MAC5C,SAAS;AAAA,MAAG,WAAW;AAAA,MAAG,SAAS;AAAA,MAAG,WAAW;AAAA,MACjD,SAAS;AAAA,MAAG,OAAO;AAAA,MAAG,UAAU;AAAA,MAAG,aAAa;AAAA,IAAA;AAElD,eAAW,EAAE,MAAM,MAAA,KAAW,WAAW;AACvC,kBAAY,IAAI,IAAI;AAAA,IACtB;AAEA,UAAM,gBAA4C;AAAA,MAChD,OAAO;AAAA,MAAG,QAAQ;AAAA,MAAG,YAAY;AAAA,MAAG,UAAU;AAAA,IAAA;AAEhD,eAAW,EAAE,QAAQ,MAAA,KAAW,aAAa;AAC3C,oBAAc,MAAM,IAAI;AAAA,IAC1B;AAEA,UAAM,cAAe,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA,KAGpC,EAAE,MAA4B;AAE/B,UAAM,kBAAkB,aAAa,IAAI,aAAa,aAAa;AAEnE,UAAM,gBAAgB,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQrC,EAAE,IAAA;AAEH,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,KAAK,MAAM,kBAAkB,GAAG,IAAI;AAAA,MACrD;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,KAA4B;AACtC,UAAM,OAAO,KAAK,GAAG,QAAQ,0CAA0C;AACvE,UAAM,MAAM,KAAK,IAAI,GAAG;AACxB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,KAAa,OAAqB;AAC5C,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA,KAG5B;AACD,SAAK,IAAI,KAAK,KAAK;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,UAAU,KAA6B;AAC7C,UAAM,OAAO,KAAK,YAAY,IAAI,EAAE;AACpC,UAAM,gBAAgB,KAAK,iBAAiB,IAAI,EAAE;AAClD,UAAM,gBAAgB,KAAK,iBAAiB,IAAI,EAAE;AAElD,WAAO;AAAA,MACL,IAAI,IAAI;AAAA,MACR,MAAM,IAAI;AAAA,MACV,UAAU,IAAI;AAAA,MACd,OAAO,IAAI;AAAA,MACX,MAAM,IAAI;AAAA,MACV,QAAQ,IAAI;AAAA,MACZ,SAAS,IAAI,WAAW;AAAA,MACxB,aAAa,cAAc,IAAI,aAAa,CAAA,CAAE;AAAA,MAC9C;AAAA,MACA,eAAe,cAAc,IAAI,CAAA,OAAM;AAAA,QACrC,QAAQ,EAAE;AAAA,QACV,MAAM;AAAA,QACN,SAAS,EAAE;AAAA,MAAA,EACX;AAAA,MACF,eAAe,cAAc,IAAI,CAAA,OAAM;AAAA,QACrC,QAAQ,EAAE;AAAA,QACV,MAAM;AAAA,QACN,SAAS,EAAE;AAAA,MAAA,EACX;AAAA,MACF,WAAW,IAAI;AAAA,MACf,cAAc,IAAI,KAAK,IAAI,UAAU;AAAA,IAAA;AAAA,EAEzC;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAU,KAAyB;AACzC,WAAO;AAAA,MACL,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,MAAM,IAAI;AAAA,MACV,QAAQ,IAAI;AAAA,MACZ,SAAS,IAAI,WAAW;AAAA,IAAA;AAAA,EAE5B;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,GAAG,MAAA;AAAA,EACV;AAAA;AAAA;AAAA;AAAA,EAKA,cAAiC;AAC/B,WAAO,KAAK;AAAA,EACd;AACF;AA8BO,SAAS,eAAe,QAAwC;AACrE,SAAO,IAAI,uBAAuB,MAAM;AAC1C;"}

package/dist/core/graph.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Knowledge Graph Core
+ *
+ * Core graph data structure and operations for managing knowledge nodes.
+ */
+import type { KnowledgeNode, KnowledgeGraph, GraphEdge, GraphMetadata, GraphStats, NodeType, NodeStatus } from './types.js';
+/**
+ * Knowledge Graph Manager
+ *
+ * Manages the in-memory knowledge graph with efficient operations
+ * for node/edge management, traversal, and analysis.
+ */
+export declare class KnowledgeGraphManager {
+    private nodes;
+    private edges;
+    private incomingIndex;
+    private outgoingIndex;
+    private tagIndex;
+    private metadata;
+    constructor(name: string, rootPath: string);
+    /**
+     * Add a node to the graph
+     */
+    addNode(node: KnowledgeNode): void;
+    /**
+     * Get a node by ID
+     */
+    getNode(id: string): KnowledgeNode | undefined;
+    /**
+     * Get all nodes
+     */
+    getAllNodes(): KnowledgeNode[];
+    /**
+     * Get nodes by type
+     */
+    getNodesByType(type: NodeType): KnowledgeNode[];
+    /**
+     * Get nodes by status
+     */
+    getNodesByStatus(status: NodeStatus): KnowledgeNode[];
+    /**
+     * Get nodes by tag
+     */
+    getNodesByTag(tag: string): KnowledgeNode[];
+    /**
+     * Update a node
+     */
+    updateNode(id: string, updates: Partial<KnowledgeNode>): boolean;
+    /**
+     * Remove a node
+     */
+    removeNode(id: string): boolean;
+    /**
+     * Add an edge to the graph
+     */
+    addEdge(edge: GraphEdge): void;
+    /**
+     * Get incoming edges for a node
+     */
+    getIncomingEdges(nodeId: string): GraphEdge[];
+    /**
+     * Get outgoing edges for a node
+     */
+    getOutgoingEdges(nodeId: string): GraphEdge[];
+    /**
+     * Get all edges
+     */
+    getAllEdges(): GraphEdge[];
+    /**
+     * Find orphan nodes (no incoming or outgoing links)
+     */
+    findOrphanNodes(): KnowledgeNode[];
+    /**
+     * Find most connected nodes
+     */
+    findMostConnected(limit?: number): Array<{
+        node: KnowledgeNode;
+        connections: number;
+    }>;
+    /**
+     * Find path between two nodes (BFS)
+     */
+    findPath(sourceId: string, targetId: string): string[] | null;
+    /**
+     * Find related nodes (nodes connected within n hops)
+     */
+    findRelated(nodeId: string, maxHops?: number): KnowledgeNode[];
+    /**
+     * Get graph statistics
+     */
+    getStats(): GraphStats;
+    /**
+     * Export graph to JSON
+     */
+    toJSON(): KnowledgeGraph;
+    /**
+     * Import graph from JSON
+     */
+    static fromJSON(data: KnowledgeGraph): KnowledgeGraphManager;
+    /**
+     * Get graph metadata
+     */
+    getMetadata(): GraphMetadata;
+}
+/**
+ * Create a new knowledge graph manager
+ */
+export declare function createKnowledgeGraph(name: string, rootPath: string): KnowledgeGraphManager;
+//# sourceMappingURL=graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/core/graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,aAAa,EACb,cAAc,EACd,SAAS,EACT,aAAa,EACb,UAAU,EACV,QAAQ,EACR,UAAU,EAEX,MAAM,YAAY,CAAC;AAEpB;;;;;GAKG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,KAAK,CAAyC;IACtD,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,QAAQ,CAAuC;IACvD,OAAO,CAAC,QAAQ,CAAgB;gBAEpB,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IAgB1C;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,aAAa,GAAG,IAAI;IAyBlC;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAI9C;;OAEG;IACH,WAAW,IAAI,aAAa,EAAE;IAI9B;;OAEG;IACH,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa,EAAE;IAI/C;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,aAAa,EAAE;IAIrD;;OAEG;IACH,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,EAAE;IAQ3C;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,GAAG,OAAO;IA6BhE;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAiC/B;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IAyB9B;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAI7C;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAI7C;;OAEG;IACH,WAAW,IAAI,SAAS,EAAE;IAQ1B;;OAEG;IACH,eAAe,IAAI,aAAa,EAAE;IAQlC;;OAEG;IACH,iBAAiB,CAAC,KAAK,SAAK,GAAG,KAAK,CAAC;QAAE,IAAI,EAAE,aAAa,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC;IAkBlF;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI;IAkC7D;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,SAAI,GAAG,aAAa,EAAE;IAiCzD;;OAEG;IACH,QAAQ,IAAI,UAAU;IAiDtB;;OAEG;IACH,MAAM,IAAI,cAAc;IAQxB;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,GAAG,qBAAqB;IA4B5D;;OAEG;IACH,WAAW,IAAI,aAAa;CAG7B;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,qBAAqB,CAE1F"}

package/dist/core/graph.js

@@ -0,0 +1,343 @@
+class KnowledgeGraphManager {
+  nodes = /* @__PURE__ */ new Map();
+  edges = [];
+  incomingIndex = /* @__PURE__ */ new Map();
+  outgoingIndex = /* @__PURE__ */ new Map();
+  tagIndex = /* @__PURE__ */ new Map();
+  metadata;
+  constructor(name, rootPath) {
+    this.metadata = {
+      name,
+      version: "1.0.0",
+      created: (/* @__PURE__ */ new Date()).toISOString(),
+      updated: (/* @__PURE__ */ new Date()).toISOString(),
+      nodeCount: 0,
+      edgeCount: 0,
+      rootPath
+    };
+  }
+  // ========================================================================
+  // Node Operations
+  // ========================================================================
+  /**
+   * Add a node to the graph
+   */
+  addNode(node) {
+    this.nodes.set(node.id, node);
+    this.metadata.nodeCount = this.nodes.size;
+    this.metadata.updated = (/* @__PURE__ */ new Date()).toISOString();
+    for (const tag of node.tags) {
+      if (!this.tagIndex.has(tag)) {
+        this.tagIndex.set(tag, /* @__PURE__ */ new Set());
+      }
+      this.tagIndex.get(tag).add(node.id);
+    }
+    for (const link of node.outgoingLinks) {
+      this.addEdge({
+        source: node.id,
+        target: link.target,
+        type: "link",
+        weight: 1,
+        context: link.context
+      });
+    }
+  }
+  /**
+   * Get a node by ID
+   */
+  getNode(id) {
+    return this.nodes.get(id);
+  }
+  /**
+   * Get all nodes
+   */
+  getAllNodes() {
+    return Array.from(this.nodes.values());
+  }
+  /**
+   * Get nodes by type
+   */
+  getNodesByType(type) {
+    return this.getAllNodes().filter((node) => node.type === type);
+  }
+  /**
+   * Get nodes by status
+   */
+  getNodesByStatus(status) {
+    return this.getAllNodes().filter((node) => node.status === status);
+  }
+  /**
+   * Get nodes by tag
+   */
+  getNodesByTag(tag) {
+    const nodeIds = this.tagIndex.get(tag);
+    if (!nodeIds) return [];
+    return Array.from(nodeIds).map((id) => this.nodes.get(id)).filter((n) => n !== void 0);
+  }
+  /**
+   * Update a node
+   */
+  updateNode(id, updates) {
+    const existing = this.nodes.get(id);
+    if (!existing) return false;
+    if (updates.tags) {
+      for (const tag of existing.tags) {
+        this.tagIndex.get(tag)?.delete(id);
+      }
+      for (const tag of updates.tags) {
+        if (!this.tagIndex.has(tag)) {
+          this.tagIndex.set(tag, /* @__PURE__ */ new Set());
+        }
+        this.tagIndex.get(tag).add(id);
+      }
+    }
+    const updated = {
+      ...existing,
+      ...updates,
+      lastModified: /* @__PURE__ */ new Date()
+    };
+    this.nodes.set(id, updated);
+    this.metadata.updated = (/* @__PURE__ */ new Date()).toISOString();
+    return true;
+  }
+  /**
+   * Remove a node
+   */
+  removeNode(id) {
+    const node = this.nodes.get(id);
+    if (!node) return false;
+    for (const tag of node.tags) {
+      this.tagIndex.get(tag)?.delete(id);
+    }
+    this.edges = this.edges.filter((e) => e.source !== id && e.target !== id);
+    this.incomingIndex.delete(id);
+    this.outgoingIndex.delete(id);
+    for (const [targetId, edges] of this.incomingIndex) {
+      this.incomingIndex.set(targetId, edges.filter((e) => e.source !== id));
+    }
+    for (const [sourceId, edges] of this.outgoingIndex) {
+      this.outgoingIndex.set(sourceId, edges.filter((e) => e.target !== id));
+    }
+    this.nodes.delete(id);
+    this.metadata.nodeCount = this.nodes.size;
+    this.metadata.edgeCount = this.edges.length;
+    this.metadata.updated = (/* @__PURE__ */ new Date()).toISOString();
+    return true;
+  }
+  // ========================================================================
+  // Edge Operations
+  // ========================================================================
+  /**
+   * Add an edge to the graph
+   */
+  addEdge(edge) {
+    const exists = this.edges.some(
+      (e) => e.source === edge.source && e.target === edge.target && e.type === edge.type
+    );
+    if (exists) return;
+    this.edges.push(edge);
+    if (!this.incomingIndex.has(edge.target)) {
+      this.incomingIndex.set(edge.target, []);
+    }
+    this.incomingIndex.get(edge.target).push(edge);
+    if (!this.outgoingIndex.has(edge.source)) {
+      this.outgoingIndex.set(edge.source, []);
+    }
+    this.outgoingIndex.get(edge.source).push(edge);
+    this.metadata.edgeCount = this.edges.length;
+    this.metadata.updated = (/* @__PURE__ */ new Date()).toISOString();
+  }
+  /**
+   * Get incoming edges for a node
+   */
+  getIncomingEdges(nodeId) {
+    return this.incomingIndex.get(nodeId) || [];
+  }
+  /**
+   * Get outgoing edges for a node
+   */
+  getOutgoingEdges(nodeId) {
+    return this.outgoingIndex.get(nodeId) || [];
+  }
+  /**
+   * Get all edges
+   */
+  getAllEdges() {
+    return [...this.edges];
+  }
+  // ========================================================================
+  // Graph Analysis
+  // ========================================================================
+  /**
+   * Find orphan nodes (no incoming or outgoing links)
+   */
+  findOrphanNodes() {
+    return this.getAllNodes().filter((node) => {
+      const incoming = this.getIncomingEdges(node.id);
+      const outgoing = this.getOutgoingEdges(node.id);
+      return incoming.length === 0 && outgoing.length === 0;
+    });
+  }
+  /**
+   * Find most connected nodes
+   */
+  findMostConnected(limit = 10) {
+    const connections = /* @__PURE__ */ new Map();
+    for (const node of this.nodes.keys()) {
+      const incoming = this.getIncomingEdges(node).length;
+      const outgoing = this.getOutgoingEdges(node).length;
+      connections.set(node, incoming + outgoing);
+    }
+    return Array.from(connections.entries()).sort((a, b) => b[1] - a[1]).slice(0, limit).map(([id, count]) => ({
+      node: this.nodes.get(id),
+      connections: count
+    }));
+  }
+  /**
+   * Find path between two nodes (BFS)
+   */
+  findPath(sourceId, targetId) {
+    if (!this.nodes.has(sourceId) || !this.nodes.has(targetId)) {
+      return null;
+    }
+    if (sourceId === targetId) {
+      return [sourceId];
+    }
+    const visited = /* @__PURE__ */ new Set();
+    const queue = [
+      { node: sourceId, path: [sourceId] }
+    ];
+    while (queue.length > 0) {
+      const { node, path } = queue.shift();
+      if (visited.has(node)) continue;
+      visited.add(node);
+      const outgoing = this.getOutgoingEdges(node);
+      for (const edge of outgoing) {
+        if (edge.target === targetId) {
+          return [...path, targetId];
+        }
+        if (!visited.has(edge.target)) {
+          queue.push({ node: edge.target, path: [...path, edge.target] });
+        }
+      }
+    }
+    return null;
+  }
+  /**
+   * Find related nodes (nodes connected within n hops)
+   */
+  findRelated(nodeId, maxHops = 2) {
+    const related = /* @__PURE__ */ new Set();
+    const visited = /* @__PURE__ */ new Set();
+    const queue = [{ node: nodeId, hops: 0 }];
+    while (queue.length > 0) {
+      const { node, hops } = queue.shift();
+      if (visited.has(node) || hops > maxHops) continue;
+      visited.add(node);
+      if (node !== nodeId) {
+        related.add(node);
+      }
+      if (hops < maxHops) {
+        const outgoing = this.getOutgoingEdges(node);
+        const incoming = this.getIncomingEdges(node);
+        for (const edge of [...outgoing, ...incoming]) {
+          const neighbor = edge.source === node ? edge.target : edge.source;
+          if (!visited.has(neighbor)) {
+            queue.push({ node: neighbor, hops: hops + 1 });
+          }
+        }
+      }
+    }
+    return Array.from(related).map((id) => this.nodes.get(id)).filter((n) => n !== void 0);
+  }
+  /**
+   * Get graph statistics
+   */
+  getStats() {
+    const nodesByType = {
+      concept: 0,
+      technical: 0,
+      feature: 0,
+      primitive: 0,
+      service: 0,
+      guide: 0,
+      standard: 0,
+      integration: 0
+    };
+    const nodesByStatus = {
+      draft: 0,
+      active: 0,
+      deprecated: 0,
+      archived: 0
+    };
+    for (const node of this.nodes.values()) {
+      nodesByType[node.type]++;
+      nodesByStatus[node.status]++;
+    }
+    const orphanNodes = this.findOrphanNodes().length;
+    const avgLinksPerNode = this.nodes.size > 0 ? this.edges.length / this.nodes.size : 0;
+    const mostConnected = this.findMostConnected(5).map(({ node, connections }) => ({
+      id: node.id,
+      connections
+    }));
+    return {
+      totalNodes: this.nodes.size,
+      totalEdges: this.edges.length,
+      nodesByType,
+      nodesByStatus,
+      orphanNodes,
+      avgLinksPerNode: Math.round(avgLinksPerNode * 100) / 100,
+      mostConnected
+    };
+  }
+  // ========================================================================
+  // Serialization
+  // ========================================================================
+  /**
+   * Export graph to JSON
+   */
+  toJSON() {
+    return {
+      nodes: this.nodes,
+      edges: [...this.edges],
+      metadata: { ...this.metadata }
+    };
+  }
+  /**
+   * Import graph from JSON
+   */
+  static fromJSON(data) {
+    const manager = new KnowledgeGraphManager(
+      data.metadata.name,
+      data.metadata.rootPath
+    );
+    for (const [id, node] of data.nodes) {
+      manager.nodes.set(id, node);
+      for (const tag of node.tags) {
+        if (!manager.tagIndex.has(tag)) {
+          manager.tagIndex.set(tag, /* @__PURE__ */ new Set());
+        }
+        manager.tagIndex.get(tag).add(id);
+      }
+    }
+    for (const edge of data.edges) {
+      manager.addEdge(edge);
+    }
+    manager.metadata = { ...data.metadata };
+    return manager;
+  }
+  /**
+   * Get graph metadata
+   */
+  getMetadata() {
+    return { ...this.metadata };
+  }
+}
+function createKnowledgeGraph(name, rootPath) {
+  return new KnowledgeGraphManager(name, rootPath);
+}
+export {
+  KnowledgeGraphManager,
+  createKnowledgeGraph
+};
+//# sourceMappingURL=graph.js.map

package/dist/core/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sources":["../../src/core/graph.ts"],"sourcesContent":["/**\n * Knowledge Graph Core\n *\n * Core graph data structure and operations for managing knowledge nodes.\n */\n\nimport type {\n  KnowledgeNode,\n  KnowledgeGraph,\n  GraphEdge,\n  GraphMetadata,\n  GraphStats,\n  NodeType,\n  NodeStatus,\n  NodeLink,\n} from './types.js';\n\n/**\n * Knowledge Graph Manager\n *\n * Manages the in-memory knowledge graph with efficient operations\n * for node/edge management, traversal, and analysis.\n */\nexport class KnowledgeGraphManager {\n  private nodes: Map<string, KnowledgeNode> = new Map();\n  private edges: GraphEdge[] = [];\n  private incomingIndex: Map<string, GraphEdge[]> = new Map();\n  private outgoingIndex: Map<string, GraphEdge[]> = new Map();\n  private tagIndex: Map<string, Set<string>> = new Map();\n  private metadata: GraphMetadata;\n\n  constructor(name: string, rootPath: string) {\n    this.metadata = {\n      name,\n      version: '1.0.0',\n      created: new Date().toISOString(),\n      updated: new Date().toISOString(),\n      nodeCount: 0,\n      edgeCount: 0,\n      rootPath,\n    };\n  }\n\n  // ========================================================================\n  // Node Operations\n  // ========================================================================\n\n  /**\n   * Add a node to the graph\n   */\n  addNode(node: KnowledgeNode): void {\n    this.nodes.set(node.id, node);\n    this.metadata.nodeCount = this.nodes.size;\n    this.metadata.updated = new Date().toISOString();\n\n    // Index tags\n    for (const tag of node.tags) {\n      if (!this.tagIndex.has(tag)) {\n        this.tagIndex.set(tag, new Set());\n      }\n      this.tagIndex.get(tag)!.add(node.id);\n    }\n\n    // Create edges from outgoing links\n    for (const link of node.outgoingLinks) {\n      this.addEdge({\n        source: node.id,\n        target: link.target,\n        type: 'link',\n        weight: 1,\n        context: link.context,\n      });\n    }\n  }\n\n  /**\n   * Get a node by ID\n   */\n  getNode(id: string): KnowledgeNode | undefined {\n    return this.nodes.get(id);\n  }\n\n  /**\n   * Get all nodes\n   */\n  getAllNodes(): KnowledgeNode[] {\n    return Array.from(this.nodes.values());\n  }\n\n  /**\n   * Get nodes by type\n   */\n  getNodesByType(type: NodeType): KnowledgeNode[] {\n    return this.getAllNodes().filter(node => node.type === type);\n  }\n\n  /**\n   * Get nodes by status\n   */\n  getNodesByStatus(status: NodeStatus): KnowledgeNode[] {\n    return this.getAllNodes().filter(node => node.status === status);\n  }\n\n  /**\n   * Get nodes by tag\n   */\n  getNodesByTag(tag: string): KnowledgeNode[] {\n    const nodeIds = this.tagIndex.get(tag);\n    if (!nodeIds) return [];\n    return Array.from(nodeIds)\n      .map(id => this.nodes.get(id))\n      .filter((n): n is KnowledgeNode => n !== undefined);\n  }\n\n  /**\n   * Update a node\n   */\n  updateNode(id: string, updates: Partial<KnowledgeNode>): boolean {\n    const existing = this.nodes.get(id);\n    if (!existing) return false;\n\n    // Handle tag changes\n    if (updates.tags) {\n      // Remove old tags from index\n      for (const tag of existing.tags) {\n        this.tagIndex.get(tag)?.delete(id);\n      }\n      // Add new tags to index\n      for (const tag of updates.tags) {\n        if (!this.tagIndex.has(tag)) {\n          this.tagIndex.set(tag, new Set());\n        }\n        this.tagIndex.get(tag)!.add(id);\n      }\n    }\n\n    const updated: KnowledgeNode = {\n      ...existing,\n      ...updates,\n      lastModified: new Date(),\n    };\n    this.nodes.set(id, updated);\n    this.metadata.updated = new Date().toISOString();\n    return true;\n  }\n\n  /**\n   * Remove a node\n   */\n  removeNode(id: string): boolean {\n    const node = this.nodes.get(id);\n    if (!node) return false;\n\n    // Remove from tag index\n    for (const tag of node.tags) {\n      this.tagIndex.get(tag)?.delete(id);\n    }\n\n    // Remove related edges\n    this.edges = this.edges.filter(e => e.source !== id && e.target !== id);\n    this.incomingIndex.delete(id);\n    this.outgoingIndex.delete(id);\n\n    // Update indices for remaining edges\n    for (const [targetId, edges] of this.incomingIndex) {\n      this.incomingIndex.set(targetId, edges.filter(e => e.source !== id));\n    }\n    for (const [sourceId, edges] of this.outgoingIndex) {\n      this.outgoingIndex.set(sourceId, edges.filter(e => e.target !== id));\n    }\n\n    this.nodes.delete(id);\n    this.metadata.nodeCount = this.nodes.size;\n    this.metadata.edgeCount = this.edges.length;\n    this.metadata.updated = new Date().toISOString();\n    return true;\n  }\n\n  // ========================================================================\n  // Edge Operations\n  // ========================================================================\n\n  /**\n   * Add an edge to the graph\n   */\n  addEdge(edge: GraphEdge): void {\n    // Check for duplicates\n    const exists = this.edges.some(\n      e => e.source === edge.source && e.target === edge.target && e.type === edge.type\n    );\n    if (exists) return;\n\n    this.edges.push(edge);\n\n    // Update incoming index\n    if (!this.incomingIndex.has(edge.target)) {\n      this.incomingIndex.set(edge.target, []);\n    }\n    this.incomingIndex.get(edge.target)!.push(edge);\n\n    // Update outgoing index\n    if (!this.outgoingIndex.has(edge.source)) {\n      this.outgoingIndex.set(edge.source, []);\n    }\n    this.outgoingIndex.get(edge.source)!.push(edge);\n\n    this.metadata.edgeCount = this.edges.length;\n    this.metadata.updated = new Date().toISOString();\n  }\n\n  /**\n   * Get incoming edges for a node\n   */\n  getIncomingEdges(nodeId: string): GraphEdge[] {\n    return this.incomingIndex.get(nodeId) || [];\n  }\n\n  /**\n   * Get outgoing edges for a node\n   */\n  getOutgoingEdges(nodeId: string): GraphEdge[] {\n    return this.outgoingIndex.get(nodeId) || [];\n  }\n\n  /**\n   * Get all edges\n   */\n  getAllEdges(): GraphEdge[] {\n    return [...this.edges];\n  }\n\n  // ========================================================================\n  // Graph Analysis\n  // ========================================================================\n\n  /**\n   * Find orphan nodes (no incoming or outgoing links)\n   */\n  findOrphanNodes(): KnowledgeNode[] {\n    return this.getAllNodes().filter(node => {\n      const incoming = this.getIncomingEdges(node.id);\n      const outgoing = this.getOutgoingEdges(node.id);\n      return incoming.length === 0 && outgoing.length === 0;\n    });\n  }\n\n  /**\n   * Find most connected nodes\n   */\n  findMostConnected(limit = 10): Array<{ node: KnowledgeNode; connections: number }> {\n    const connections = new Map<string, number>();\n\n    for (const node of this.nodes.keys()) {\n      const incoming = this.getIncomingEdges(node).length;\n      const outgoing = this.getOutgoingEdges(node).length;\n      connections.set(node, incoming + outgoing);\n    }\n\n    return Array.from(connections.entries())\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, limit)\n      .map(([id, count]) => ({\n        node: this.nodes.get(id)!,\n        connections: count,\n      }));\n  }\n\n  /**\n   * Find path between two nodes (BFS)\n   */\n  findPath(sourceId: string, targetId: string): string[] | null {\n    if (!this.nodes.has(sourceId) || !this.nodes.has(targetId)) {\n      return null;\n    }\n\n    if (sourceId === targetId) {\n      return [sourceId];\n    }\n\n    const visited = new Set<string>();\n    const queue: Array<{ node: string; path: string[] }> = [\n      { node: sourceId, path: [sourceId] },\n    ];\n\n    while (queue.length > 0) {\n      const { node, path } = queue.shift()!;\n\n      if (visited.has(node)) continue;\n      visited.add(node);\n\n      const outgoing = this.getOutgoingEdges(node);\n      for (const edge of outgoing) {\n        if (edge.target === targetId) {\n          return [...path, targetId];\n        }\n        if (!visited.has(edge.target)) {\n          queue.push({ node: edge.target, path: [...path, edge.target] });\n        }\n      }\n    }\n\n    return null;\n  }\n\n  /**\n   * Find related nodes (nodes connected within n hops)\n   */\n  findRelated(nodeId: string, maxHops = 2): KnowledgeNode[] {\n    const related = new Set<string>();\n    const visited = new Set<string>();\n    const queue: Array<{ node: string; hops: number }> = [{ node: nodeId, hops: 0 }];\n\n    while (queue.length > 0) {\n      const { node, hops } = queue.shift()!;\n\n      if (visited.has(node) || hops > maxHops) continue;\n      visited.add(node);\n\n      if (node !== nodeId) {\n        related.add(node);\n      }\n\n      if (hops < maxHops) {\n        const outgoing = this.getOutgoingEdges(node);\n        const incoming = this.getIncomingEdges(node);\n\n        for (const edge of [...outgoing, ...incoming]) {\n          const neighbor = edge.source === node ? edge.target : edge.source;\n          if (!visited.has(neighbor)) {\n            queue.push({ node: neighbor, hops: hops + 1 });\n          }\n        }\n      }\n    }\n\n    return Array.from(related)\n      .map(id => this.nodes.get(id))\n      .filter((n): n is KnowledgeNode => n !== undefined);\n  }\n\n  /**\n   * Get graph statistics\n   */\n  getStats(): GraphStats {\n    const nodesByType: Record<NodeType, number> = {\n      concept: 0,\n      technical: 0,\n      feature: 0,\n      primitive: 0,\n      service: 0,\n      guide: 0,\n      standard: 0,\n      integration: 0,\n    };\n\n    const nodesByStatus: Record<NodeStatus, number> = {\n      draft: 0,\n      active: 0,\n      deprecated: 0,\n      archived: 0,\n    };\n\n    for (const node of this.nodes.values()) {\n      nodesByType[node.type]++;\n      nodesByStatus[node.status]++;\n    }\n\n    const orphanNodes = this.findOrphanNodes().length;\n    const avgLinksPerNode = this.nodes.size > 0\n      ? this.edges.length / this.nodes.size\n      : 0;\n\n    const mostConnected = this.findMostConnected(5).map(({ node, connections }) => ({\n      id: node.id,\n      connections,\n    }));\n\n    return {\n      totalNodes: this.nodes.size,\n      totalEdges: this.edges.length,\n      nodesByType,\n      nodesByStatus,\n      orphanNodes,\n      avgLinksPerNode: Math.round(avgLinksPerNode * 100) / 100,\n      mostConnected,\n    };\n  }\n\n  // ========================================================================\n  // Serialization\n  // ========================================================================\n\n  /**\n   * Export graph to JSON\n   */\n  toJSON(): KnowledgeGraph {\n    return {\n      nodes: this.nodes,\n      edges: [...this.edges],\n      metadata: { ...this.metadata },\n    };\n  }\n\n  /**\n   * Import graph from JSON\n   */\n  static fromJSON(data: KnowledgeGraph): KnowledgeGraphManager {\n    const manager = new KnowledgeGraphManager(\n      data.metadata.name,\n      data.metadata.rootPath\n    );\n\n    // Add nodes (this will also create edges from outgoing links)\n    for (const [id, node] of data.nodes) {\n      manager.nodes.set(id, node);\n\n      // Index tags\n      for (const tag of node.tags) {\n        if (!manager.tagIndex.has(tag)) {\n          manager.tagIndex.set(tag, new Set());\n        }\n        manager.tagIndex.get(tag)!.add(id);\n      }\n    }\n\n    // Add edges\n    for (const edge of data.edges) {\n      manager.addEdge(edge);\n    }\n\n    manager.metadata = { ...data.metadata };\n    return manager;\n  }\n\n  /**\n   * Get graph metadata\n   */\n  getMetadata(): GraphMetadata {\n    return { ...this.metadata };\n  }\n}\n\n/**\n * Create a new knowledge graph manager\n */\nexport function createKnowledgeGraph(name: string, rootPath: string): KnowledgeGraphManager {\n  return new KnowledgeGraphManager(name, rootPath);\n}\n"],"names":[],"mappings":"AAuBO,MAAM,sBAAsB;AAAA,EACzB,4BAAwC,IAAA;AAAA,EACxC,QAAqB,CAAA;AAAA,EACrB,oCAA8C,IAAA;AAAA,EAC9C,oCAA8C,IAAA;AAAA,EAC9C,+BAAyC,IAAA;AAAA,EACzC;AAAA,EAER,YAAY,MAAc,UAAkB;AAC1C,SAAK,WAAW;AAAA,MACd;AAAA,MACA,SAAS;AAAA,MACT,UAAS,oBAAI,KAAA,GAAO,YAAA;AAAA,MACpB,UAAS,oBAAI,KAAA,GAAO,YAAA;AAAA,MACpB,WAAW;AAAA,MACX,WAAW;AAAA,MACX;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,MAA2B;AACjC,SAAK,MAAM,IAAI,KAAK,IAAI,IAAI;AAC5B,SAAK,SAAS,YAAY,KAAK,MAAM;AACrC,SAAK,SAAS,WAAU,oBAAI,KAAA,GAAO,YAAA;AAGnC,eAAW,OAAO,KAAK,MAAM;AAC3B,UAAI,CAAC,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,aAAK,SAAS,IAAI,KAAK,oBAAI,KAAK;AAAA,MAClC;AACA,WAAK,SAAS,IAAI,GAAG,EAAG,IAAI,KAAK,EAAE;AAAA,IACrC;AAGA,eAAW,QAAQ,KAAK,eAAe;AACrC,WAAK,QAAQ;AAAA,QACX,QAAQ,KAAK;AAAA,QACb,QAAQ,KAAK;AAAA,QACb,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,SAAS,KAAK;AAAA,MAAA,CACf;AAAA,IACH;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAuC;AAC7C,WAAO,KAAK,MAAM,IAAI,EAAE;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,cAA+B;AAC7B,WAAO,MAAM,KAAK,KAAK,MAAM,QAAQ;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe,MAAiC;AAC9C,WAAO,KAAK,YAAA,EAAc,OAAO,CAAA,SAAQ,KAAK,SAAS,IAAI;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAAqC;AACpD,WAAO,KAAK,YAAA,EAAc,OAAO,CAAA,SAAQ,KAAK,WAAW,MAAM;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,KAA8B;AAC1C,UAAM,UAAU,KAAK,SAAS,IAAI,GAAG;AACrC,QAAI,CAAC,QAAS,QAAO,CAAA;AACrB,WAAO,MAAM,KAAK,OAAO,EACtB,IAAI,QAAM,KAAK,MAAM,IAAI,EAAE,CAAC,EAC5B,OAAO,CAAC,MAA0B,MAAM,MAAS;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,IAAY,SAA0C;AAC/D,UAAM,WAAW,KAAK,MAAM,IAAI,EAAE;AAClC,QAAI,CAAC,SAAU,QAAO;AAGtB,QAAI,QAAQ,MAAM;AAEhB,iBAAW,OAAO,SAAS,MAAM;AAC/B,aAAK,SAAS,IAAI,GAAG,GAAG,OAAO,EAAE;AAAA,MACnC;AAEA,iBAAW,OAAO,QAAQ,MAAM;AAC9B,YAAI,CAAC,KAAK,SAAS,IAAI,GAAG,GAAG;AAC3B,eAAK,SAAS,IAAI,KAAK,oBAAI,KAAK;AAAA,QAClC;AACA,aAAK,SAAS,IAAI,GAAG,EAAG,IAAI,EAAE;AAAA,MAChC;AAAA,IACF;AAEA,UAAM,UAAyB;AAAA,MAC7B,GAAG;AAAA,MACH,GAAG;AAAA,MACH,kCAAkB,KAAA;AAAA,IAAK;AAEzB,SAAK,MAAM,IAAI,IAAI,OAAO;AAC1B,SAAK,SAAS,WAAU,oBAAI,KAAA,GAAO,YAAA;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,IAAqB;AAC9B,UAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,QAAI,CAAC,KAAM,QAAO;AAGlB,eAAW,OAAO,KAAK,MAAM;AAC3B,WAAK,SAAS,IAAI,GAAG,GAAG,OAAO,EAAE;AAAA,IACnC;AAGA,SAAK,QAAQ,KAAK,MAAM,OAAO,CAAA,MAAK,EAAE,WAAW,MAAM,EAAE,WAAW,EAAE;AACtE,SAAK,cAAc,OAAO,EAAE;AAC5B,SAAK,cAAc,OAAO,EAAE;AAG5B,eAAW,CAAC,UAAU,KAAK,KAAK,KAAK,eAAe;AAClD,WAAK,cAAc,IAAI,UAAU,MAAM,OAAO,CAAA,MAAK,EAAE,WAAW,EAAE,CAAC;AAAA,IACrE;AACA,eAAW,CAAC,UAAU,KAAK,KAAK,KAAK,eAAe;AAClD,WAAK,cAAc,IAAI,UAAU,MAAM,OAAO,CAAA,MAAK,EAAE,WAAW,EAAE,CAAC;AAAA,IACrE;AAEA,SAAK,MAAM,OAAO,EAAE;AACpB,SAAK,SAAS,YAAY,KAAK,MAAM;AACrC,SAAK,SAAS,YAAY,KAAK,MAAM;AACrC,SAAK,SAAS,WAAU,oBAAI,KAAA,GAAO,YAAA;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,MAAuB;AAE7B,UAAM,SAAS,KAAK,MAAM;AAAA,MACxB,CAAA,MAAK,EAAE,WAAW,KAAK,UAAU,EAAE,WAAW,KAAK,UAAU,EAAE,SAAS,KAAK;AAAA,IAAA;AAE/E,QAAI,OAAQ;AAEZ,SAAK,MAAM,KAAK,IAAI;AAGpB,QAAI,CAAC,KAAK,cAAc,IAAI,KAAK,MAAM,GAAG;AACxC,WAAK,cAAc,IAAI,KAAK,QAAQ,CAAA,CAAE;AAAA,IACxC;AACA,SAAK,cAAc,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAG9C,QAAI,CAAC,KAAK,cAAc,IAAI,KAAK,MAAM,GAAG;AACxC,WAAK,cAAc,IAAI,KAAK,QAAQ,CAAA,CAAE;AAAA,IACxC;AACA,SAAK,cAAc,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAE9C,SAAK,SAAS,YAAY,KAAK,MAAM;AACrC,SAAK,SAAS,WAAU,oBAAI,KAAA,GAAO,YAAA;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAA6B;AAC5C,WAAO,KAAK,cAAc,IAAI,MAAM,KAAK,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,QAA6B;AAC5C,WAAO,KAAK,cAAc,IAAI,MAAM,KAAK,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAKA,cAA2B;AACzB,WAAO,CAAC,GAAG,KAAK,KAAK;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,kBAAmC;AACjC,WAAO,KAAK,YAAA,EAAc,OAAO,CAAA,SAAQ;AACvC,YAAM,WAAW,KAAK,iBAAiB,KAAK,EAAE;AAC9C,YAAM,WAAW,KAAK,iBAAiB,KAAK,EAAE;AAC9C,aAAO,SAAS,WAAW,KAAK,SAAS,WAAW;AAAA,IACtD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAkB,QAAQ,IAAyD;AACjF,UAAM,kCAAkB,IAAA;AAExB,eAAW,QAAQ,KAAK,MAAM,KAAA,GAAQ;AACpC,YAAM,WAAW,KAAK,iBAAiB,IAAI,EAAE;AAC7C,YAAM,WAAW,KAAK,iBAAiB,IAAI,EAAE;AAC7C,kBAAY,IAAI,MAAM,WAAW,QAAQ;AAAA,IAC3C;AAEA,WAAO,MAAM,KAAK,YAAY,QAAA,CAAS,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;AAAA,MACrB,MAAM,KAAK,MAAM,IAAI,EAAE;AAAA,MACvB,aAAa;AAAA,IAAA,EACb;AAAA,EACN;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,UAAkB,UAAmC;AAC5D,QAAI,CAAC,KAAK,MAAM,IAAI,QAAQ,KAAK,CAAC,KAAK,MAAM,IAAI,QAAQ,GAAG;AAC1D,aAAO;AAAA,IACT;AAEA,QAAI,aAAa,UAAU;AACzB,aAAO,CAAC,QAAQ;AAAA,IAClB;AAEA,UAAM,8BAAc,IAAA;AACpB,UAAM,QAAiD;AAAA,MACrD,EAAE,MAAM,UAAU,MAAM,CAAC,QAAQ,EAAA;AAAA,IAAE;AAGrC,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,EAAE,MAAM,SAAS,MAAM,MAAA;AAE7B,UAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,cAAQ,IAAI,IAAI;AAEhB,YAAM,WAAW,KAAK,iBAAiB,IAAI;AAC3C,iBAAW,QAAQ,UAAU;AAC3B,YAAI,KAAK,WAAW,UAAU;AAC5B,iBAAO,CAAC,GAAG,MAAM,QAAQ;AAAA,QAC3B;AACA,YAAI,CAAC,QAAQ,IAAI,KAAK,MAAM,GAAG;AAC7B,gBAAM,KAAK,EAAE,MAAM,KAAK,QAAQ,MAAM,CAAC,GAAG,MAAM,KAAK,MAAM,EAAA,CAAG;AAAA,QAChE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAAgB,UAAU,GAAoB;AACxD,UAAM,8BAAc,IAAA;AACpB,UAAM,8BAAc,IAAA;AACpB,UAAM,QAA+C,CAAC,EAAE,MAAM,QAAQ,MAAM,GAAG;AAE/E,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,EAAE,MAAM,SAAS,MAAM,MAAA;AAE7B,UAAI,QAAQ,IAAI,IAAI,KAAK,OAAO,QAAS;AACzC,cAAQ,IAAI,IAAI;AAEhB,UAAI,SAAS,QAAQ;AACnB,gBAAQ,IAAI,IAAI;AAAA,MAClB;AAEA,UAAI,OAAO,SAAS;AAClB,cAAM,WAAW,KAAK,iBAAiB,IAAI;AAC3C,cAAM,WAAW,KAAK,iBAAiB,IAAI;AAE3C,mBAAW,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ,GAAG;AAC7C,gBAAM,WAAW,KAAK,WAAW,OAAO,KAAK,SAAS,KAAK;AAC3D,cAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,kBAAM,KAAK,EAAE,MAAM,UAAU,MAAM,OAAO,GAAG;AAAA,UAC/C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,OAAO,EACtB,IAAI,QAAM,KAAK,MAAM,IAAI,EAAE,CAAC,EAC5B,OAAO,CAAC,MAA0B,MAAM,MAAS;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKA,WAAuB;AACrB,UAAM,cAAwC;AAAA,MAC5C,SAAS;AAAA,MACT,WAAW;AAAA,MACX,SAAS;AAAA,MACT,WAAW;AAAA,MACX,SAAS;AAAA,MACT,OAAO;AAAA,MACP,UAAU;AAAA,MACV,aAAa;AAAA,IAAA;AAGf,UAAM,gBAA4C;AAAA,MAChD,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,UAAU;AAAA,IAAA;AAGZ,eAAW,QAAQ,KAAK,MAAM,OAAA,GAAU;AACtC,kBAAY,KAAK,IAAI;AACrB,oBAAc,KAAK,MAAM;AAAA,IAC3B;AAEA,UAAM,cAAc,KAAK,gBAAA,EAAkB;AAC3C,UAAM,kBAAkB,KAAK,MAAM,OAAO,IACtC,KAAK,MAAM,SAAS,KAAK,MAAM,OAC/B;AAEJ,UAAM,gBAAgB,KAAK,kBAAkB,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,mBAAmB;AAAA,MAC9E,IAAI,KAAK;AAAA,MACT;AAAA,IAAA,EACA;AAEF,WAAO;AAAA,MACL,YAAY,KAAK,MAAM;AAAA,MACvB,YAAY,KAAK,MAAM;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,KAAK,MAAM,kBAAkB,GAAG,IAAI;AAAA,MACrD;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAyB;AACvB,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,OAAO,CAAC,GAAG,KAAK,KAAK;AAAA,MACrB,UAAU,EAAE,GAAG,KAAK,SAAA;AAAA,IAAS;AAAA,EAEjC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAS,MAA6C;AAC3D,UAAM,UAAU,IAAI;AAAA,MAClB,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,IAAA;AAIhB,eAAW,CAAC,IAAI,IAAI,KAAK,KAAK,OAAO;AACnC,cAAQ,MAAM,IAAI,IAAI,IAAI;AAG1B,iBAAW,OAAO,KAAK,MAAM;AAC3B,YAAI,CAAC,QAAQ,SAAS,IAAI,GAAG,GAAG;AAC9B,kBAAQ,SAAS,IAAI,KAAK,oBAAI,KAAK;AAAA,QACrC;AACA,gBAAQ,SAAS,IAAI,GAAG,EAAG,IAAI,EAAE;AAAA,MACnC;AAAA,IACF;AAGA,eAAW,QAAQ,KAAK,OAAO;AAC7B,cAAQ,QAAQ,IAAI;AAAA,IACtB;AAEA,YAAQ,WAAW,EAAE,GAAG,KAAK,SAAA;AAC7B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,cAA6B;AAC3B,WAAO,EAAE,GAAG,KAAK,SAAA;AAAA,EACnB;AACF;AAKO,SAAS,qBAAqB,MAAc,UAAyC;AAC1F,SAAO,IAAI,sBAAsB,MAAM,QAAQ;AACjD;"}

package/dist/core/security.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Security Utilities
+ *
+ * Helper functions for input validation and security.
+ */
+/**
+ * Validate that a path stays within a base directory
+ * Prevents path traversal attacks
+ *
+ * @param basePath - The base directory that paths must stay within
+ * @param relativePath - The relative path to validate
+ * @returns The resolved absolute path
+ * @throws Error if path traversal is detected
+ */
+export declare function validatePath(basePath: string, relativePath: string): string;
+/**
+ * Validate and sanitize a project root path
+ * Ensures the path exists and is a directory
+ *
+ * @param projectRoot - The project root path
+ * @returns The resolved absolute path
+ * @throws Error if invalid
+ */
+export declare function validateProjectRoot(projectRoot: string): string;
+/**
+ * Validate a docs path relative to project root
+ *
+ * @param projectRoot - The project root path
+ * @param docsPath - The docs directory path (relative or absolute)
+ * @returns The validated absolute path
+ * @throws Error if path traversal detected
+ */
+export declare function validateDocsPath(projectRoot: string, docsPath: string): string;
+/**
+ * Sanitize a filename to prevent directory traversal
+ *
+ * @param filename - The filename to sanitize
+ * @returns The sanitized filename
+ */
+export declare function sanitizeFilename(filename: string): string;
+/**
+ * Sanitize user input for safe display
+ * Removes potentially dangerous characters
+ *
+ * @param input - The input string to sanitize
+ * @param maxLength - Maximum length (default 1000)
+ * @returns The sanitized string
+ */
+export declare function sanitizeInput(input: string, maxLength?: number): string;
+/**
+ * Validate a template path - must be within project and be a .md file
+ *
+ * @param projectRoot - The project root path
+ * @param templatePath - The template path to validate
+ * @returns The validated absolute path or null if invalid
+ */
+export declare function validateTemplatePath(projectRoot: string, templatePath: string): string | null;
+/**
+ * Check if a string looks like a file path
+ */
+export declare function looksLikePath(str: string): boolean;
+//# sourceMappingURL=security.d.ts.map

package/dist/core/security.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"security.d.ts","sourceRoot":"","sources":["../../src/core/security.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAiB3E;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAc/D;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAQ9E;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAUzD;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,MAAM,CASrE;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,GACnB,MAAM,GAAG,IAAI,CAcf;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAElD"}

package/dist/core/security.js

@@ -0,0 +1,31 @@
+import { resolve, isAbsolute, normalize } from "path";
+function validatePath(basePath, relativePath) {
+  const resolvedBase = resolve(basePath);
+  const targetPath = isAbsolute(relativePath) ? normalize(relativePath) : resolve(resolvedBase, relativePath);
+  const normalizedTarget = normalize(targetPath);
+  if (!normalizedTarget.startsWith(resolvedBase + "/") && normalizedTarget !== resolvedBase) {
+    throw new Error(`Path traversal detected: "${relativePath}" escapes base directory`);
+  }
+  return normalizedTarget;
+}
+function validateProjectRoot(projectRoot) {
+  if (!projectRoot || typeof projectRoot !== "string") {
+    throw new Error("Project root path is required");
+  }
+  const resolved = resolve(projectRoot);
+  if (resolved.includes("\0")) {
+    throw new Error("Invalid null byte in path");
+  }
+  return resolved;
+}
+function validateDocsPath(projectRoot, docsPath) {
+  const resolvedRoot = validateProjectRoot(projectRoot);
+  const safeDocs = docsPath?.trim() || "docs";
+  return validatePath(resolvedRoot, safeDocs);
+}
+export {
+  validateDocsPath,
+  validatePath,
+  validateProjectRoot
+};
+//# sourceMappingURL=security.js.map

package/dist/core/security.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"security.js","sources":["../../src/core/security.ts"],"sourcesContent":["/**\n * Security Utilities\n *\n * Helper functions for input validation and security.\n */\n\nimport { resolve, normalize, isAbsolute } from 'path';\n\n/**\n * Validate that a path stays within a base directory\n * Prevents path traversal attacks\n *\n * @param basePath - The base directory that paths must stay within\n * @param relativePath - The relative path to validate\n * @returns The resolved absolute path\n * @throws Error if path traversal is detected\n */\nexport function validatePath(basePath: string, relativePath: string): string {\n  // Resolve the base path to absolute\n  const resolvedBase = resolve(basePath);\n\n  // Handle absolute paths - must still be within base\n  const targetPath = isAbsolute(relativePath)\n    ? normalize(relativePath)\n    : resolve(resolvedBase, relativePath);\n\n  const normalizedTarget = normalize(targetPath);\n\n  // Ensure the resolved path is within the base path\n  if (!normalizedTarget.startsWith(resolvedBase + '/') && normalizedTarget !== resolvedBase) {\n    throw new Error(`Path traversal detected: \"${relativePath}\" escapes base directory`);\n  }\n\n  return normalizedTarget;\n}\n\n/**\n * Validate and sanitize a project root path\n * Ensures the path exists and is a directory\n *\n * @param projectRoot - The project root path\n * @returns The resolved absolute path\n * @throws Error if invalid\n */\nexport function validateProjectRoot(projectRoot: string): string {\n  if (!projectRoot || typeof projectRoot !== 'string') {\n    throw new Error('Project root path is required');\n  }\n\n  // Resolve to absolute path\n  const resolved = resolve(projectRoot);\n\n  // Check for suspicious patterns\n  if (resolved.includes('\\0')) {\n    throw new Error('Invalid null byte in path');\n  }\n\n  return resolved;\n}\n\n/**\n * Validate a docs path relative to project root\n *\n * @param projectRoot - The project root path\n * @param docsPath - The docs directory path (relative or absolute)\n * @returns The validated absolute path\n * @throws Error if path traversal detected\n */\nexport function validateDocsPath(projectRoot: string, docsPath: string): string {\n  const resolvedRoot = validateProjectRoot(projectRoot);\n\n  // Default to 'docs' if empty\n  const safeDocs = docsPath?.trim() || 'docs';\n\n  // Validate it stays within project\n  return validatePath(resolvedRoot, safeDocs);\n}\n\n/**\n * Sanitize a filename to prevent directory traversal\n *\n * @param filename - The filename to sanitize\n * @returns The sanitized filename\n */\nexport function sanitizeFilename(filename: string): string {\n  if (!filename || typeof filename !== 'string') {\n    return 'untitled';\n  }\n\n  return filename\n    .replace(/\\.\\./g, '') // Remove parent directory references\n    .replace(/[<>:\"|?*\\0]/g, '') // Remove invalid filename chars\n    .replace(/^\\/+|\\/+$/g, '') // Remove leading/trailing slashes\n    .slice(0, 255); // Limit length\n}\n\n/**\n * Sanitize user input for safe display\n * Removes potentially dangerous characters\n *\n * @param input - The input string to sanitize\n * @param maxLength - Maximum length (default 1000)\n * @returns The sanitized string\n */\nexport function sanitizeInput(input: string, maxLength = 1000): string {\n  if (!input || typeof input !== 'string') {\n    return '';\n  }\n\n  return input\n    .replace(/[<>&\"'`]/g, '') // Remove HTML-sensitive chars\n    .slice(0, maxLength)\n    .trim();\n}\n\n/**\n * Validate a template path - must be within project and be a .md file\n *\n * @param projectRoot - The project root path\n * @param templatePath - The template path to validate\n * @returns The validated absolute path or null if invalid\n */\nexport function validateTemplatePath(\n  projectRoot: string,\n  templatePath: string\n): string | null {\n  try {\n    const resolvedRoot = validateProjectRoot(projectRoot);\n    const validated = validatePath(resolvedRoot, templatePath);\n\n    // Must be a markdown file\n    if (!validated.endsWith('.md')) {\n      return null;\n    }\n\n    return validated;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Check if a string looks like a file path\n */\nexport function looksLikePath(str: string): boolean {\n  return str.includes('/') || str.includes('\\\\') || str.startsWith('.');\n}\n"],"names":[],"mappings":";AAiBO,SAAS,aAAa,UAAkB,cAA8B;AAE3E,QAAM,eAAe,QAAQ,QAAQ;AAGrC,QAAM,aAAa,WAAW,YAAY,IACtC,UAAU,YAAY,IACtB,QAAQ,cAAc,YAAY;AAEtC,QAAM,mBAAmB,UAAU,UAAU;AAG7C,MAAI,CAAC,iBAAiB,WAAW,eAAe,GAAG,KAAK,qBAAqB,cAAc;AACzF,UAAM,IAAI,MAAM,6BAA6B,YAAY,0BAA0B;AAAA,EACrF;AAEA,SAAO;AACT;AAUO,SAAS,oBAAoB,aAA6B;AAC/D,MAAI,CAAC,eAAe,OAAO,gBAAgB,UAAU;AACnD,UAAM,IAAI,MAAM,+BAA+B;AAAA,EACjD;AAGA,QAAM,WAAW,QAAQ,WAAW;AAGpC,MAAI,SAAS,SAAS,IAAI,GAAG;AAC3B,UAAM,IAAI,MAAM,2BAA2B;AAAA,EAC7C;AAEA,SAAO;AACT;AAUO,SAAS,iBAAiB,aAAqB,UAA0B;AAC9E,QAAM,eAAe,oBAAoB,WAAW;AAGpD,QAAM,WAAW,UAAU,KAAA,KAAU;AAGrC,SAAO,aAAa,cAAc,QAAQ;AAC5C;"}