Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 | /** * MemoryGraphStore - 记忆图谱状态管理 * * 管理记忆图谱可视化的状态，包括节点、边、布局和交互。 */ import { create } from 'zustand'; import { persist } from 'zustand/middleware'; import { intelligenceClient, type MemoryEntry, type MemoryType, } from '../lib/intelligence-client'; export type { MemoryType }; // === Types === export interface GraphNode { id: string; type: MemoryType; label: string; x: number; y: number; vx: number; vy: number; importance: number; accessCount: number; createdAt: string; isHighlighted: boolean; isSelected: boolean; } export interface GraphEdge { id: string; source: string; target: string; type: 'reference' | 'related' | 'derived'; strength: number; } export interface GraphFilter { types: MemoryType[]; minImportance: number; dateRange: { start?: string; end?: string; }; searchQuery: string; } export interface GraphLayout { width: number; height: number; zoom: number; offsetX: number; offsetY: number; } interface MemoryGraphState { nodes: GraphNode[]; edges: GraphEdge[]; isLoading: boolean; error: string | null; filter: GraphFilter; layout: GraphLayout; selectedNodeId: string | null; hoveredNodeId: string | null; showLabels: boolean; simulationRunning: boolean; } interface MemoryGraphActions { loadGraph: (agentId: string) => Promise<void>; setFilter: (filter: Partial<GraphFilter>) => void; resetFilter: () => void; setLayout: (layout: Partial<GraphLayout>) => void; selectNode: (nodeId: string | null) => void; hoverNode: (nodeId: string | null) => void; toggleLabels: () => void; startSimulation: () => void; stopSimulation: () => void; updateNodePositions: (updates: Array<{ id: string; x: number; y: number }>) => void; highlightSearch: (query: string) => void; clearHighlight: () => void; exportAsImage: () => Promise<Blob | null>; getFilteredNodes: () => GraphNode[]; getFilteredEdges: () => GraphEdge[]; } const DEFAULT_FILTER: GraphFilter = { types: ['fact', 'preference', 'lesson', 'context', 'task'], minImportance: 0, dateRange: {}, searchQuery: '', }; const DEFAULT_LAYOUT: GraphLayout = { width: 800, height: 600, zoom: 1, offsetX: 0, offsetY: 0, }; export type MemoryGraphStore = MemoryGraphState & MemoryGraphActions; // === Helper Functions === function memoryToNode(memory: MemoryEntry, index: number, total: number): GraphNode { // 使用圆形布局初始位置 const angle = (index / total) * 2 * Math.PI; const radius = 200; return { id: memory.id, type: memory.type, label: memory.content.slice(0, 50) + (memory.content.length > 50 ? '...' : ''), x: 400 + radius * Math.cos(angle), y: 300 + radius * Math.sin(angle), vx: 0, vy: 0, importance: memory.importance, accessCount: memory.accessCount, createdAt: memory.createdAt, isHighlighted: false, isSelected: false, }; } function findRelatedMemories(memories: MemoryEntry[]): GraphEdge[] { const edges: GraphEdge[] = []; // 简单的关联算法：基于共同标签和关键词 for (let i = 0; i < memories.length; i++) { for (let j = i + 1; j < memories.length; j++) { const m1 = memories[i]; const m2 = memories[j]; // 检查共同标签 const commonTags = m1.tags.filter(t => m2.tags.includes(t)); if (commonTags.length > 0) { edges.push({ id: `edge-${m1.id}-${m2.id}`, source: m1.id, target: m2.id, type: 'related', strength: commonTags.length * 0.3, }); } // 同类型记忆关联 if (m1.type === m2.type) { const existingEdge = edges.find( e => e.source === m1.id && e.target === m2.id ); if (!existingEdge) { edges.push({ id: `edge-${m1.id}-${m2.id}-type`, source: m1.id, target: m2.id, type: 'derived', strength: 0.1, }); } } } } return edges; } export const useMemoryGraphStore = create<MemoryGraphStore>()( persist( (set, get) => ({ nodes: [], edges: [], isLoading: false, error: null, filter: DEFAULT_FILTER, layout: DEFAULT_LAYOUT, selectedNodeId: null, hoveredNodeId: null, showLabels: true, simulationRunning: false, loadGraph: async (agentId: string) => { set({ isLoading: true, error: null }); try { const memories = await intelligenceClient.memory.search({ agentId, limit: 200, }); const nodes = memories.map((m, i) => memoryToNode(m, i, memories.length)); const edges = findRelatedMemories(memories); set({ nodes, edges, isLoading: false, }); } catch (err) { set({ isLoading: false, error: err instanceof Error ? err.message : '加载图谱失败', }); } }, setFilter: (filter) => { set(state => ({ filter: { ...state.filter, ...filter }, })); }, resetFilter: () => { set({ filter: DEFAULT_FILTER }); }, setLayout: (layout) => { set(state => ({ layout: { ...state.layout, ...layout }, })); }, selectNode: (nodeId) => { set(state => ({ selectedNodeId: nodeId, nodes: state.nodes.map(n => ({ ...n, isSelected: n.id === nodeId, })), })); }, hoverNode: (nodeId) => { set(state => ({ hoveredNodeId: nodeId, nodes: state.nodes.map(n => ({ ...n, isHighlighted: nodeId ? n.id === nodeId : n.isHighlighted, })), })); }, toggleLabels: () => { set(state => ({ showLabels: !state.showLabels })); }, startSimulation: () => { set({ simulationRunning: true }); }, stopSimulation: () => { set({ simulationRunning: false }); }, updateNodePositions: (updates) => { set(state => ({ nodes: state.nodes.map(node => { const update = updates.find(u => u.id === node.id); return update ? { ...node, x: update.x, y: update.y } : node; }), })); }, highlightSearch: (query) => { const lowerQuery = query.toLowerCase(); set(state => ({ filter: { ...state.filter, searchQuery: query }, nodes: state.nodes.map(n => ({ ...n, isHighlighted: query ? n.label.toLowerCase().includes(lowerQuery) : false, })), })); }, clearHighlight: () => { set(state => ({ nodes: state.nodes.map(n => ({ ...n, isHighlighted: false })), })); }, exportAsImage: async () => { // SVG 导出逻辑在组件中实现 return null; }, getFilteredNodes: () => { const { nodes, filter } = get(); return nodes.filter(n => { if (!filter.types.includes(n.type)) return false; if (n.importance < filter.minImportance) return false; if (filter.dateRange.start && n.createdAt < filter.dateRange.start) return false; if (filter.dateRange.end && n.createdAt > filter.dateRange.end) return false; if (filter.searchQuery) { return n.label.toLowerCase().includes(filter.searchQuery.toLowerCase()); } return true; }); }, getFilteredEdges: () => { const { edges } = get(); const filteredNodes = get().getFilteredNodes(); const nodeIds = new Set(filteredNodes.map(n => n.id)); return edges.filter(e => nodeIds.has(e.source) && nodeIds.has(e.target)); }, }), { name: 'zclaw-memory-graph', partialize: (state) => ({ filter: state.filter, layout: state.layout, showLabels: state.showLabels, }), } ) ); |