Function addInterlinkedContext

src/core/memory-graph.ts:273–310

(rootDir: string, items: Array<{ type: NodeType; label: string; content: string; metadata?: Record<string, string> }>, autoLink: boolean = true)

}

export async function addInterlinkedContext(rootDir: string, items: Array<{ type: NodeType; label: string; content: string; metadata?: Record<string, string> }>, autoLink: boolean = true): Promise<{ nodes: MemoryNode[]; edges: MemoryEdge[] }> {
  const createdNodes: MemoryNode[] = [];
  for (const item of items) {
    createdNodes.push(await upsertNode(rootDir, item.type, item.label, item.content, item.metadata));
  }

  const createdEdges: MemoryEdge[] = [];

  if (autoLink && createdNodes.length > 1) {
    for (let i = 0; i < createdNodes.length; i++) {
      for (let j = i + 1; j < createdNodes.length; j++) {
        const similarity = cosine(createdNodes[i].embedding, createdNodes[j].embedding);
        if (similarity >= SIMILARITY_THRESHOLD) {
          const edge = await createRelation(rootDir, createdNodes[i].id, createdNodes[j].id, "similar_to", similarity);
          if (edge) createdEdges.push(edge);
        }
      }
    }
  }

  const graph = await loadGraph(rootDir);
  const existingNodes = Object.values(graph.nodes)
    .filter(n => !createdNodes.find(cn => cn.id === n.id))
    .slice(0, 200);
  if (autoLink) {
    for (const newNode of createdNodes) {
      for (const existing of existingNodes) {
        const similarity = cosine(newNode.embedding, existing.embedding);
        if (similarity >= SIMILARITY_THRESHOLD) {
          const edge = await createRelation(rootDir, newNode.id, existing.id, "similar_to", similarity);
          if (edge) createdEdges.push(edge);
        }
      }
    }
  }

  return { nodes: createdNodes, edges: createdEdges };
}

export async function retrieveWithTraversal(rootDir: string, startNodeId: string, maxDepth: number = 2, edgeFilter?: RelationType[]): Promise<TraversalResult[]> {
  const graph = await loadGraph(rootDir);