@andespindola/brainlink 0.1.0-beta.80 → 0.1.0-beta.81

package/README.md

@@ -82,7 +82,7 @@ Legacy `.jsonl.gz` packs are upgraded to `.blpk` automatically on first search/c
 - Local HTTP API.
 - Realtime graph UI with agent selector and colored knowledge groups.
 - Graph renderer optimized for large datasets with viewport-driven node culling and edge lookup by visible nodes.
-- Large graph canvas rendering batches regular nodes and edges to reduce per-frame draw calls while keeping selected and hovered items highlighted.
+- Canvas graph rendering uses the same batched node and edge pipeline for every graph size, reducing per-frame draw calls while keeping selected and hovered items highlighted.
 - Large graph layout API automatically uses compact payload encoding with link-coverage-aware edge selection to reduce initial client load without hiding major relationships.
 - Large-segment layout spacing now grows logarithmically to keep initial visual density consistent between medium and very large vaults (for example, ~1k vs ~50k notes).
 - Zoomed-out graph LOD clusters dense regions and progressively expands the focused viewport as zoom increases, including very large vaults.
@@ -595,7 +595,7 @@ The graph UI shows:
 - keyboard shortcuts: `+` zoom in, `-` zoom out, `0` reset fit
 - double-click on canvas zooms in at cursor position
 - floating graph totals (notes, links, tags) below the Brainlink title
-- large-graph rendering safeguards (batched canvas drawing, edge draw caps, lower redraw rate, zoom-aware interaction)
+- graph rendering safeguards (batched canvas drawing across graph sizes, edge draw caps, lower redraw rate, zoom-aware interaction)
 - massive-graph LOD progression: very low zoom uses spatial overview sampling plus hub-neighborhood edge previews to preserve whole-vault shape and orientation, then progressively raises the focused node budget as zoom increases so dense local areas keep nearby notes and links visible
 
 The server indexes before starting by default. Use `--no-index` to skip that step:

package/dist/application/frontend/client-js.js

@@ -930,57 +930,42 @@ const drawEdgeBatch = (edges, options) => {
   ctx.stroke()
 }
 
-const drawGraphEdges = () => {
-  if (state.nodes.length > largeGraphNodeThreshold) {
-    const regularEdges = []
-    const inferredEdges = []
-    const selectedEdges = []
-
-    for (let index = 0; index < state.renderEdges.length; index += 1) {
-      const edge = state.renderEdges[index]
-      const isSelected = state.selected && (edge.source === state.selected.id || edge.target === state.selected.id)
-      if (isSelected) {
-        selectedEdges.push(edge)
-      } else if (edge.inferred) {
-        inferredEdges.push(edge)
-      } else {
-        regularEdges.push(edge)
-      }
-    }
-
-    const scale = state.transform.scale
-    const regularOpacity = edgeOpacityForScale({ inferred: false }, scale)
-    const inferredOpacity = edgeOpacityForScale({ inferred: true }, scale)
-    drawEdgeBatch(regularEdges, {
-      strokeStyle: 'rgba(153, 165, 181, ' + regularOpacity + ')',
-      lineWidth: 1.05
-    })
-    drawEdgeBatch(inferredEdges, {
-      strokeStyle: 'rgba(203, 213, 225, ' + inferredOpacity + ')',
-      lineWidth: 0.84
-    })
+const regularEdgeBatchOptions = (edge) => ({
+  strokeStyle: edgeStrokeFor(edge, false),
+  lineWidth: edgeWidthFor(edge, false)
+})
 
-    for (let index = 0; index < selectedEdges.length; index += 1) {
-      drawGraphEdge(selectedEdges[index])
-    }
-    return
-  }
+const regularEdgeBatchKey = (edge) => {
+  const options = regularEdgeBatchOptions(edge)
+  return options.strokeStyle + '|' + options.lineWidth.toFixed(2)
+}
 
+const drawGraphEdges = () => {
+  const edgeBatches = new Map()
   const selectedEdges = []
-  const regularEdges = []
+
   for (let index = 0; index < state.renderEdges.length; index += 1) {
     const edge = state.renderEdges[index]
     const isSelected = state.selected && (edge.source === state.selected.id || edge.target === state.selected.id)
     if (isSelected) {
       selectedEdges.push(edge)
+      continue
+    }
+
+    const key = regularEdgeBatchKey(edge)
+    const batch = edgeBatches.get(key)
+    if (batch) {
+      batch.edges.push(edge)
     } else {
-      regularEdges.push(edge)
+      edgeBatches.set(key, {
+        edges: [edge],
+        options: regularEdgeBatchOptions(edge)
+      })
     }
   }
 
-  for (let index = 0; index < regularEdges.length; index += 1) {
-    drawGraphEdge(regularEdges[index])
-  }
+  edgeBatches.forEach((batch) => drawEdgeBatch(batch.edges, batch.options))
+
   for (let index = 0; index < selectedEdges.length; index += 1) {
     drawGraphEdge(selectedEdges[index])
   }
@@ -1049,11 +1034,6 @@ const drawNodeBatch = (nodes) => {
 }
 
 const drawGraphNodes = () => {
-  if (state.nodes.length <= largeGraphNodeThreshold) {
-    state.renderNodes.forEach(node => drawSingleNode(node))
-    return
-  }
-
   const regularNodes = []
   const priorityNodes = []
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@andespindola/brainlink",
-  "version": "0.1.0-beta.80",
+  "version": "0.1.0-beta.81",
   "description": "Local-first knowledge memory for agents with Markdown, backlinks, indexing and context retrieval.",
   "type": "module",
   "license": "MIT",