@lmzhen/dsh-evolution-learning-graph 0.1.0-rc.25 → 0.1.0-rc.26

package/lib/index.js

@@ -8,8 +8,13 @@ import { SKILL_NAME_RE, SkillLibrary, evolutionIoAdapter } from "@lmzhen/dsh-evo
 * file's entries).
 * @module @lmzhen/dsh-evolution-learning-graph
 */
-/** Build a small deterministic graph from usage records and memory entries. */
-function buildLearningGraph(usage, memoryEntries) {
+/**
+* Build a small deterministic graph from usage records and memory entries.
+* Memory node ids follow `memory:<source>:<index>` (source = memory|user,
+* index = position in that file's entries) — the SAME rule the parser
+* `parseGraphNodeId` accepts, so graph detail/edit/delete round-trips.
+*/
+function buildLearningGraph(usage, memoryEntries, userEntries = []) {
 	const nodes = [...usage.keys()].map((name) => ({
 		id: name,
 		kind: "skill",
@@ -26,20 +31,24 @@ function buildLearningGraph(usage, memoryEntries) {
 			type: "related"
 		});
 	}
-	memoryEntries.forEach((entry, index) => {
-		const id = `memory:${index}`;
-		nodes.push({
-			id,
-			kind: "memory",
-			label: entry.split("\n")[0]?.slice(0, 80) ?? id
-		});
-		const token = entry.toLowerCase();
-		for (const name of sorted) if (name && token.includes(name.toLowerCase())) edges.push({
-			from: id,
-			to: name,
-			type: "memory_skill"
+	const appendMemory = (source, entries) => {
+		entries.forEach((entry, index) => {
+			const id = `memory:${source}:${index}`;
+			nodes.push({
+				id,
+				kind: "memory",
+				label: entry.split("\n")[0]?.slice(0, 80) ?? id
+			});
+			const token = entry.toLowerCase();
+			for (const name of sorted) if (name && token.includes(name.toLowerCase())) edges.push({
+				from: id,
+				to: name,
+				type: "memory_skill"
+			});
 		});
-	});
+	};
+	appendMemory("memory", memoryEntries);
+	appendMemory("user", userEntries);
 	return {
 		nodes,
 		edges
@@ -107,7 +116,7 @@ function apply(ctx) {
 				if (input !== "") return { text: `Unknown graph subcommand "${input.split(" ")[0]}". ${directory}` };
 				return { text: directory };
 				async function renderGraph() {
-					const graph = buildLearningGraph(await usage.report(), await memory.read("memory"));
+					const graph = buildLearningGraph(await usage.report(), await memory.read("memory"), await memory.read("user"));
 					const lines = graph.nodes.map((node) => (node.kind === "memory" ? "◆" : "●") + " " + node.label);
 					const edges = graph.edges.map((edge) => edge.from + " --" + edge.type + "--> " + edge.to);
 					return lines.join("\n") + "\n\n" + edges.join("\n");

package/lib/types/index.d.ts

@@ -21,11 +21,16 @@ export interface LearningGraph {
     nodes: GraphNode[];
     edges: GraphEdge[];
 }
-/** Build a small deterministic graph from usage records and memory entries. */
+/**
+ * Build a small deterministic graph from usage records and memory entries.
+ * Memory node ids follow `memory:<source>:<index>` (source = memory|user,
+ * index = position in that file's entries) — the SAME rule the parser
+ * `parseGraphNodeId` accepts, so graph detail/edit/delete round-trips.
+ */
 export declare function buildLearningGraph(usage: ReadonlyMap<string, {
     use_count?: number;
     pinned?: boolean;
-}>, memoryEntries: readonly string[]): LearningGraph;
+}>, memoryEntries: readonly string[], userEntries?: readonly string[]): LearningGraph;
 export type GraphNodeId = {
     kind: 'skill';
     name: string;

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@lmzhen/dsh-evolution-learning-graph",
   "description": "Learning graph over skills and memory (community build)",
-  "version": "0.1.0-rc.25",
+  "version": "0.1.0-rc.26",
   "publishConfig": {
     "access": "public"
   },
@@ -33,7 +33,7 @@
   "license": "MIT",
   "dependencies": {
     "@deepseek-ai/schemastery": "^3.18.1",
-    "@lmzhen/dsh-evolution-core": "^0.1.0-rc.25"
+    "@lmzhen/dsh-evolution-core": "^0.1.0-rc.26"
   },
   "peerDependencies": {
     "@deepseek-ai/dsh-invariants": "^0.1.0-rc.6",