@rubytech/create-sitedesk-code 0.1.340

package/payload/platform/plugins/graph-viewer/mcp/dist/render/draw.js

@@ -0,0 +1,73 @@
+/**
+ * Canvas drawing for the graph-render tool. Takes a laid-out graph and
+ * produces a PNG buffer.
+ *
+ * Visual contract:
+ *   - Background matches the /graph page's surface colour (#FAFAF8).
+ *   - Node fill comes from platform/lib/graph-style's resolveNodeColour —
+ *     identical hue to the live page for the same labels.
+ *   - Node label is pickShortLabel from the same shared lib, rendered
+ *     below the node circle in a sans-serif fallback. Exact webfont match
+ *     is filed as a follow-up.
+ *   - Edges are thin grey lines with a small arrowhead. Edge type labels
+ *     are intentionally omitted — they crowd the canvas at high node
+ *     counts and the operator can drill into the live page if they need
+ *     them.
+ */
+import { createCanvas } from "@napi-rs/canvas";
+import { resolveNodeColour, pickShortLabel, } from "../../../../../lib/graph-style/dist/index.js";
+const BACKGROUND = "#FAFAF8";
+const EDGE_COLOUR = "#C9C7C2";
+const NODE_RADIUS = 12;
+const NODE_STROKE = "#FFFFFF";
+const NODE_STROKE_WIDTH = 2;
+const LABEL_COLOUR = "#1A1A1A";
+const LABEL_FONT = "12px sans-serif";
+const LABEL_PADDING_Y = 4;
+export function drawGraph(input) {
+    const { layout, nodeProperties, width, height } = input;
+    const canvas = createCanvas(width, height);
+    const ctx = canvas.getContext("2d");
+    ctx.fillStyle = BACKGROUND;
+    ctx.fillRect(0, 0, width, height);
+    const nodeIndex = new Map();
+    for (const n of layout.nodes)
+        nodeIndex.set(n.id, n);
+    // Edges first, so node circles cover the endpoints.
+    ctx.strokeStyle = EDGE_COLOUR;
+    ctx.lineWidth = 1;
+    for (const e of layout.edges) {
+        const from = nodeIndex.get(e.from);
+        const to = nodeIndex.get(e.to);
+        if (!from || !to)
+            continue;
+        ctx.beginPath();
+        ctx.moveTo(from.x, from.y);
+        ctx.lineTo(to.x, to.y);
+        ctx.stroke();
+    }
+    // Nodes: filled circle, white stroke, label below.
+    ctx.font = LABEL_FONT;
+    ctx.textAlign = "center";
+    ctx.textBaseline = "top";
+    for (const n of layout.nodes) {
+        const { colour } = resolveNodeColour(n.labels);
+        ctx.fillStyle = colour;
+        ctx.beginPath();
+        ctx.arc(n.x, n.y, NODE_RADIUS, 0, Math.PI * 2);
+        ctx.fill();
+        ctx.lineWidth = NODE_STROKE_WIDTH;
+        ctx.strokeStyle = NODE_STROKE;
+        ctx.stroke();
+        const props = nodeProperties[n.id] ?? {};
+        const labelNode = {
+            id: n.id,
+            labels: n.labels,
+            properties: props,
+        };
+        ctx.fillStyle = LABEL_COLOUR;
+        ctx.fillText(pickShortLabel(labelNode), n.x, n.y + NODE_RADIUS + LABEL_PADDING_Y);
+    }
+    return canvas.toBuffer("image/png");
+}
+//# sourceMappingURL=draw.js.map

package/payload/platform/plugins/graph-viewer/mcp/dist/render/draw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"draw.js","sourceRoot":"","sources":["../../src/render/draw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EACL,iBAAiB,EACjB,cAAc,GAEf,MAAM,8CAA8C,CAAC;AAGtD,MAAM,UAAU,GAAG,SAAS,CAAC;AAC7B,MAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,MAAM,WAAW,GAAG,EAAE,CAAC;AACvB,MAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,YAAY,GAAG,SAAS,CAAC;AAC/B,MAAM,UAAU,GAAG,iBAAiB,CAAC;AACrC,MAAM,eAAe,GAAG,CAAC,CAAC;AAe1B,MAAM,UAAU,SAAS,CAAC,KAAgB;IACxC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACxD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAEpC,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC;IAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAElC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAyB,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAErD,oDAAoD;IACpD,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC;IAC9B,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;YAAE,SAAS;QAC3B,GAAG,CAAC,SAAS,EAAE,CAAC;QAChB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,EAAE,CAAC;IACf,CAAC;IAED,mDAAmD;IACnD,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC;IACtB,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC;IACzB,GAAG,CAAC,YAAY,GAAG,KAAK,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/C,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC;QACvB,GAAG,CAAC,SAAS,EAAE,CAAC;QAChB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,GAAG,CAAC,IAAI,EAAE,CAAC;QACX,GAAG,CAAC,SAAS,GAAG,iBAAiB,CAAC;QAClC,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC;QAC9B,GAAG,CAAC,MAAM,EAAE,CAAC;QAEb,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACzC,MAAM,SAAS,GAAkB;YAC/B,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,KAAK;SAClB,CAAC;QACF,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC;QAC7B,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,eAAe,CAAC,CAAC;IACpF,CAAC;IAED,OAAO,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AACtC,CAAC"}

package/payload/platform/plugins/graph-viewer/mcp/dist/render/layout.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Deterministic force-directed layout for the graph-render tool.
+ *
+ * Uses d3-force with a seeded LCG so the same input graph always produces
+ * the same node positions. Layout fidelity to the live /graph page (which
+ * runs vis-network's Barnes-Hut port in the browser) is NOT a goal —
+ * d3-force's many-body repulsion plus link spring forces give a coherent
+ * force-directed layout, which is what the operator needs to read the
+ * subgraph. Pixel-equivalence with /graph is filed as a follow-up task.
+ *
+ * Convergence: a fixed iteration count rather than a kinetic-energy
+ * threshold. The kinetic-energy approach is sensitive to graph topology
+ * (sparse graphs converge in 50 iterations, dense ones never stabilise
+ * cleanly), so 300 iterations is the simple, deterministic choice. The
+ * caller logs whether iteration completed successfully.
+ */
+export interface LayoutNodeIn {
+    id: string;
+    labels: string[];
+}
+export interface LayoutEdgeIn {
+    from: string;
+    to: string;
+    type: string;
+}
+export interface LayoutNodeOut extends LayoutNodeIn {
+    x: number;
+    y: number;
+}
+export interface LayoutResult {
+    nodes: LayoutNodeOut[];
+    edges: LayoutEdgeIn[];
+    iterations: number;
+}
+export declare function layoutGraph(nodes: LayoutNodeIn[], edges: LayoutEdgeIn[], opts: {
+    width: number;
+    height: number;
+    seed?: number;
+}): LayoutResult;
+//# sourceMappingURL=layout.d.ts.map

package/payload/platform/plugins/graph-viewer/mcp/dist/render/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../src/render/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAcH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,aAAc,SAAQ,YAAY;IACjD,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;CACpB;AA6BD,wBAAgB,WAAW,CACzB,KAAK,EAAE,YAAY,EAAE,EACrB,KAAK,EAAE,YAAY,EAAE,EACrB,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,GACrD,YAAY,CAsFd"}

package/payload/platform/plugins/graph-viewer/mcp/dist/render/layout.js

@@ -0,0 +1,117 @@
+/**
+ * Deterministic force-directed layout for the graph-render tool.
+ *
+ * Uses d3-force with a seeded LCG so the same input graph always produces
+ * the same node positions. Layout fidelity to the live /graph page (which
+ * runs vis-network's Barnes-Hut port in the browser) is NOT a goal —
+ * d3-force's many-body repulsion plus link spring forces give a coherent
+ * force-directed layout, which is what the operator needs to read the
+ * subgraph. Pixel-equivalence with /graph is filed as a follow-up task.
+ *
+ * Convergence: a fixed iteration count rather than a kinetic-energy
+ * threshold. The kinetic-energy approach is sensitive to graph topology
+ * (sparse graphs converge in 50 iterations, dense ones never stabilise
+ * cleanly), so 300 iterations is the simple, deterministic choice. The
+ * caller logs whether iteration completed successfully.
+ */
+import { forceSimulation, forceLink, forceManyBody, forceCenter, forceX, forceY, } from "d3-force";
+/**
+ * Seeded LCG (linear-congruential generator). Used as d3-force's
+ * randomSource so layout is deterministic across runs. Values are the
+ * Numerical Recipes constants — fast, adequate for jittering initial
+ * positions, not cryptographically interesting.
+ */
+function seededRandom(seed) {
+    let state = seed >>> 0;
+    return () => {
+        state = (state * 1664525 + 1013904223) >>> 0;
+        return state / 0x100000000;
+    };
+}
+const ITERATIONS = 300;
+const LINK_DISTANCE = 90;
+const CHARGE_STRENGTH = -240;
+const CENTER_STRENGTH = 0.05;
+const FIT_PADDING = 60;
+export function layoutGraph(nodes, edges, opts) {
+    const seed = opts.seed ?? 1;
+    const rand = seededRandom(seed);
+    // Drop edges whose endpoints aren't in the node set — d3-force will
+    // throw on a missing endpoint, and the upstream Cypher might return
+    // edges whose far side was capped off by the truncation cut.
+    const nodeIds = new Set(nodes.map((n) => n.id));
+    const validEdges = edges.filter((e) => nodeIds.has(e.from) && nodeIds.has(e.to));
+    // Initial positions: jittered around the centre. d3-force will
+    // displace them over the iteration count.
+    const cx = opts.width / 2;
+    const cy = opts.height / 2;
+    const simNodes = nodes.map((n) => ({
+        id: n.id,
+        labels: n.labels,
+        x: cx + (rand() - 0.5) * 40,
+        y: cy + (rand() - 0.5) * 40,
+    }));
+    const simLinks = validEdges.map((e) => ({
+        source: e.from,
+        target: e.to,
+        type: e.type,
+    }));
+    const simulation = forceSimulation(simNodes)
+        .randomSource(rand)
+        .force("link", forceLink(simLinks)
+        .id((d) => d.id)
+        .distance(LINK_DISTANCE))
+        .force("charge", forceManyBody().strength(CHARGE_STRENGTH))
+        .force("center", forceCenter(cx, cy))
+        .force("x", forceX(cx).strength(CENTER_STRENGTH))
+        .force("y", forceY(cy).strength(CENTER_STRENGTH))
+        .stop();
+    simulation.tick(ITERATIONS);
+    // Fit-to-content pass. The force simulation settles into a cluster that
+    // can be much smaller than the canvas (typical for sparse subgraphs of a
+    // few nodes), leaving the operator with two tiny dots in the middle of a
+    // 1200×900 image. Compute the bounding box of the settled positions and
+    // apply a uniform scale + translate so the cluster fills the canvas with
+    // a `FIT_PADDING` border. Aspect ratio is preserved. Degenerate cases
+    // (single node, or all nodes collapsed onto one point) skip scaling and
+    // are centred at (cx, cy).
+    let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
+    for (const n of simNodes) {
+        const x = n.x ?? cx;
+        const y = n.y ?? cy;
+        if (x < minX)
+            minX = x;
+        if (x > maxX)
+            maxX = x;
+        if (y < minY)
+            minY = y;
+        if (y > maxY)
+            maxY = y;
+    }
+    const bboxW = maxX - minX;
+    const bboxH = maxY - minY;
+    const targetW = opts.width - 2 * FIT_PADDING;
+    const targetH = opts.height - 2 * FIT_PADDING;
+    // Degenerate when a single node, or all nodes collapsed within one pixel.
+    const degenerate = simNodes.length <= 1 || (bboxW < 1 && bboxH < 1);
+    const scale = degenerate
+        ? 1
+        : Math.min(targetW / Math.max(bboxW, 1), targetH / Math.max(bboxH, 1));
+    const outNodes = simNodes.map((n) => {
+        const x = n.x ?? cx;
+        const y = n.y ?? cy;
+        if (degenerate)
+            return { id: n.id, labels: n.labels, x: cx, y: cy };
+        // Centre the scaled bbox on the canvas centre.
+        const scaledCx = (minX + bboxW / 2) * scale;
+        const scaledCy = (minY + bboxH / 2) * scale;
+        return {
+            id: n.id,
+            labels: n.labels,
+            x: x * scale - scaledCx + cx,
+            y: y * scale - scaledCy + cy,
+        };
+    });
+    return { nodes: outNodes, edges: validEdges, iterations: ITERATIONS };
+}
+//# sourceMappingURL=layout.js.map

package/payload/platform/plugins/graph-viewer/mcp/dist/render/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../src/render/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EACL,eAAe,EACf,SAAS,EACT,aAAa,EACb,WAAW,EACX,MAAM,EACN,MAAM,GAIP,MAAM,UAAU,CAAC;AAwBlB;;;;;GAKG;AACH,SAAS,YAAY,CAAC,IAAY;IAChC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;IACvB,OAAO,GAAG,EAAE;QACV,KAAK,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,KAAK,GAAG,WAAW,CAAC;IAC7B,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC;AAC7B,MAAM,eAAe,GAAG,IAAI,CAAC;AAC7B,MAAM,WAAW,GAAG,EAAE,CAAC;AASvB,MAAM,UAAU,WAAW,CACzB,KAAqB,EACrB,KAAqB,EACrB,IAAsD;IAEtD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEhC,oEAAoE;IACpE,oEAAoE;IACpE,6DAA6D;IAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjF,+DAA+D;IAC/D,0CAA0C;IAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,MAAM,QAAQ,GAAc,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE;QAC3B,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE;KAC5B,CAAC,CAAC,CAAC;IAEJ,MAAM,QAAQ,GAAc,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,CAAC,CAAC,IAAI;QACd,MAAM,EAAE,CAAC,CAAC,EAAE;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;KACb,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAiC,eAAe,CAAC,QAAQ,CAAC;SACvE,YAAY,CAAC,IAAI,CAAC;SAClB,KAAK,CACJ,MAAM,EACN,SAAS,CAAmB,QAAQ,CAAC;SAClC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACf,QAAQ,CAAC,aAAa,CAAC,CAC3B;SACA,KAAK,CAAC,QAAQ,EAAE,aAAa,EAAE,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;SAC1D,KAAK,CAAC,QAAQ,EAAE,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SACpC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;SAChD,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;SAChD,IAAI,EAAE,CAAC;IAEV,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAE5B,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,wEAAwE;IACxE,yEAAyE;IACzE,sEAAsE;IACtE,wEAAwE;IACxE,2BAA2B;IAC3B,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC;IAC9C,0EAA0E;IAC1E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,UAAU;QACtB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAEzE,MAAM,QAAQ,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACnD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,IAAI,UAAU;YAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QACpE,+CAA+C;QAC/C,MAAM,QAAQ,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5C,MAAM,QAAQ,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5C,OAAO;YACL,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,QAAQ,GAAG,EAAE;YAC5B,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,QAAQ,GAAG,EAAE;SAC7B,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AACxE,CAAC"}

package/payload/platform/plugins/graph-viewer/mcp/dist/tools/graph-render.d.ts

@@ -0,0 +1,45 @@
+/**
+ * graph-render — produce an inline PNG of an account-scoped Neo4j
+ * subgraph rooted at a given nodeId, walking up to `hopDepth` hops.
+ *
+ * Surface contract:
+ *   - The root node must exist and belong to the caller's account.
+ *     A missing or foreign-account root returns a structured refusal,
+ *     never throws.
+ *   - The expansion is bounded by both `hopDepth` (max 3 to keep the
+ *     image legible) and a hard 200-node cap. Subgraphs that exceed
+ *     the cap render the first 200 nodes and carry a `truncated`
+ *     envelope so the agent can tell the operator.
+ *   - `:Trashed` nodes are excluded everywhere — matches memory-search.
+ *   - One observability line per invocation, prefixed `[graph-render]`.
+ *
+ * The Cypher hopDepth is INLINED into the query string after a strict
+ * validate (`Number.isInteger && 0 <= n <= 3`) because Neo4j does not
+ * parameterise variable-length path bounds. Anything outside that range
+ * fails fast at the param-validation layer, well before string assembly.
+ */
+export interface GraphRenderParams {
+    accountId: string;
+    nodeId: string;
+    hopDepth: number;
+}
+export interface GraphRenderRefusal {
+    ok: false;
+    reason: "scope" | "empty" | "cap-exceeded" | "draw-error" | "invalid-input";
+    message: string;
+}
+export interface GraphRenderSuccess {
+    ok: true;
+    path: string;
+    width: number;
+    height: number;
+    nodeCount: number;
+    edgeCount: number;
+    truncated?: {
+        rendered: number;
+        total: number;
+    };
+}
+export type GraphRenderResult = GraphRenderSuccess | GraphRenderRefusal;
+export declare function graphRender(params: GraphRenderParams): Promise<GraphRenderResult>;
+//# sourceMappingURL=graph-render.d.ts.map

package/payload/platform/plugins/graph-viewer/mcp/dist/tools/graph-render.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-render.d.ts","sourceRoot":"","sources":["../../src/tools/graph-render.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AA6BH,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,KAAK,CAAC;IACV,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,cAAc,GAAG,YAAY,GAAG,eAAe,CAAC;IAC5E,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,IAAI,CAAC;IACT,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;CACjD;AAED,MAAM,MAAM,iBAAiB,GAAG,kBAAkB,GAAG,kBAAkB,CAAC;AAMxE,wBAAsB,WAAW,CAC/B,MAAM,EAAE,iBAAiB,GACxB,OAAO,CAAC,iBAAiB,CAAC,CAkL5B"}

package/payload/platform/plugins/graph-viewer/mcp/dist/tools/graph-render.js

@@ -0,0 +1,199 @@
+/**
+ * graph-render — produce an inline PNG of an account-scoped Neo4j
+ * subgraph rooted at a given nodeId, walking up to `hopDepth` hops.
+ *
+ * Surface contract:
+ *   - The root node must exist and belong to the caller's account.
+ *     A missing or foreign-account root returns a structured refusal,
+ *     never throws.
+ *   - The expansion is bounded by both `hopDepth` (max 3 to keep the
+ *     image legible) and a hard 200-node cap. Subgraphs that exceed
+ *     the cap render the first 200 nodes and carry a `truncated`
+ *     envelope so the agent can tell the operator.
+ *   - `:Trashed` nodes are excluded everywhere — matches memory-search.
+ *   - One observability line per invocation, prefixed `[graph-render]`.
+ *
+ * The Cypher hopDepth is INLINED into the query string after a strict
+ * validate (`Number.isInteger && 0 <= n <= 3`) because Neo4j does not
+ * parameterise variable-length path bounds. Anything outside that range
+ * fails fast at the param-validation layer, well before string assembly.
+ */
+import { mkdirSync, writeFileSync } from "node:fs";
+import { resolve } from "node:path";
+import { getSession } from "../lib/neo4j.js";
+import { layoutGraph } from "../render/layout.js";
+import { drawGraph } from "../render/draw.js";
+function getAccountsDir() {
+    const root = process.env.PLATFORM_ROOT ?? process.env.MAXY_PLATFORM_ROOT;
+    if (!root) {
+        throw new Error("[graph-render] PLATFORM_ROOT not set (also checked MAXY_PLATFORM_ROOT) — cannot resolve account output dir.");
+    }
+    return resolve(root, "..", "data/accounts");
+}
+function slugifyElementId(elementId) {
+    // Neo4j elementIds use `:` as a separator; filesystem-safe replacement
+    // keeps the digest readable while avoiding path-segment confusion.
+    return elementId.replace(/[:/\\]/g, "_");
+}
+const NODE_CAP = 200;
+const MAX_HOP_DEPTH = 3;
+const IMAGE_WIDTH = 1200;
+const IMAGE_HEIGHT = 900;
+function logLine(line) {
+    process.stderr.write(`${line}\n`);
+}
+export async function graphRender(params) {
+    const { accountId, nodeId } = params;
+    const hopDepth = params.hopDepth;
+    if (!Number.isInteger(hopDepth) || hopDepth < 0 || hopDepth > MAX_HOP_DEPTH) {
+        return {
+            ok: false,
+            reason: "invalid-input",
+            message: `hopDepth must be an integer between 0 and ${MAX_HOP_DEPTH} (got ${String(hopDepth)})`,
+        };
+    }
+    const t0 = Date.now();
+    const session = getSession();
+    try {
+        // Step 1 — confirm root exists and belongs to this account. The
+        // explicit two-step check (rather than relying on the expand to
+        // return zero rows) is what lets us return reason="scope" vs
+        // reason="empty" with a meaningful message.
+        const rootCheck = await session.run(`MATCH (root)
+       WHERE elementId(root) = $nodeId
+       RETURN root.accountId AS rootAccountId, labels(root) AS rootLabels`, { nodeId });
+        if (rootCheck.records.length === 0) {
+            logLine(`[graph-render] reject account=${accountId} reason=scope nodeId=${nodeId} cause=not-found`);
+            return {
+                ok: false,
+                reason: "scope",
+                message: `No node with id ${nodeId} is visible to this account.`,
+            };
+        }
+        const rootAccountId = rootCheck.records[0].get("rootAccountId");
+        if (rootAccountId !== accountId) {
+            logLine(`[graph-render] reject account=${accountId} reason=scope nodeId=${nodeId} cause=foreign-account`);
+            return {
+                ok: false,
+                reason: "scope",
+                message: `Node ${nodeId} is not visible to this account.`,
+            };
+        }
+        logLine(`[graph-render] start account=${accountId} nodeId=${nodeId} hopDepth=${hopDepth}`);
+        // Step 2 — expand. Variable-length path bound is inlined after the
+        // hopDepth validation above. Account filter + trash filter applied to
+        // every node on every path. RELATIONSHIPS only between matched nodes.
+        const expandQuery = `
+      MATCH (root) WHERE elementId(root) = $nodeId
+      MATCH path = (root)-[*0..${hopDepth}]-(n)
+      WHERE n.accountId = $accountId AND NOT n:Trashed
+      WITH collect(DISTINCT n) AS nodes
+      WITH nodes[0..$cap] AS capped, size(nodes) AS totalCount
+      UNWIND capped AS node
+      WITH collect({ id: elementId(node), labels: labels(node), properties: properties(node) }) AS nodeRows,
+           [n IN capped | elementId(n)] AS capIds, totalCount
+      OPTIONAL MATCH (a)-[r]->(b)
+      WHERE elementId(a) IN capIds AND elementId(b) IN capIds
+      RETURN nodeRows,
+             collect(DISTINCT { from: elementId(startNode(r)), to: elementId(endNode(r)), type: type(r) }) AS edgeRows,
+             totalCount
+    `;
+        const result = await session.run(expandQuery, {
+            nodeId,
+            accountId,
+            cap: NODE_CAP,
+        });
+        if (result.records.length === 0) {
+            logLine(`[graph-render] reject account=${accountId} reason=empty nodeId=${nodeId}`);
+            return {
+                ok: false,
+                reason: "empty",
+                message: "Root node found but its neighbourhood is empty after trash filter.",
+            };
+        }
+        const record = result.records[0];
+        const nodeRows = record.get("nodeRows");
+        const edgeRowsRaw = record.get("edgeRows");
+        const totalCountRaw = record.get("totalCount");
+        const totalCount = typeof totalCountRaw === "number"
+            ? totalCountRaw
+            : (totalCountRaw?.toNumber?.() ?? nodeRows.length);
+        // OPTIONAL MATCH on no rels produces one {from:null,to:null,type:null}
+        // row from collect; strip those.
+        const edges = edgeRowsRaw
+            .filter((e) => e.from && e.to && e.type)
+            .map((e) => ({ from: e.from, to: e.to, type: e.type }));
+        if (nodeRows.length === 0) {
+            logLine(`[graph-render] reject account=${accountId} reason=empty nodeId=${nodeId}`);
+            return {
+                ok: false,
+                reason: "empty",
+                message: "Subgraph contained no nodes after trash filter.",
+            };
+        }
+        const layoutNodes = nodeRows.map((n) => ({
+            id: n.id,
+            labels: n.labels,
+        }));
+        const nodeProperties = {};
+        for (const n of nodeRows)
+            nodeProperties[n.id] = n.properties;
+        const layout = layoutGraph(layoutNodes, edges, {
+            width: IMAGE_WIDTH,
+            height: IMAGE_HEIGHT,
+        });
+        let pngBuffer;
+        try {
+            pngBuffer = drawGraph({
+                layout,
+                nodeProperties,
+                width: IMAGE_WIDTH,
+                height: IMAGE_HEIGHT,
+            });
+        }
+        catch (err) {
+            const message = err instanceof Error ? err.message : String(err);
+            logLine(`[graph-render] reject account=${accountId} reason=draw-error nodeId=${nodeId} cause=${message}`);
+            return {
+                ok: false,
+                reason: "draw-error",
+                message: `Canvas draw failed: ${message}`,
+            };
+        }
+        // Write the PNG to a deterministic per-account output/ path. MCP `image`
+        // content blocks do not surface in the maxy-code chat transport, so the
+        // calling skill delivers the file by its path: on the admin dashboard
+        // that output/ path appears in the operator's Artefacts panel and on
+        // their file share, and on a message channel the skill forwards it with
+        // SendUserFile as an attachment (see Task 584 for the output/ doctrine).
+        // The slug+hopDepth pair makes repeated renders of the same view
+        // overwrite the same file rather than accumulating.
+        const accountsDir = getAccountsDir();
+        const outputDir = resolve(accountsDir, accountId, "output", "graph-render");
+        mkdirSync(outputDir, { recursive: true });
+        const fileName = `${slugifyElementId(nodeId)}-h${hopDepth}.png`;
+        const outputPath = resolve(outputDir, fileName);
+        writeFileSync(outputPath, pngBuffer);
+        const truncated = totalCount > nodeRows.length
+            ? { rendered: nodeRows.length, total: totalCount }
+            : undefined;
+        const ms = Date.now() - t0;
+        logLine(`[graph-render] ok account=${accountId} ms=${ms} bytes=${pngBuffer.length} ` +
+            `nodeCount=${nodeRows.length} edgeCount=${edges.length} ` +
+            `truncated=${truncated ? "true" : "false"} iterations=${layout.iterations} ` +
+            `path=${outputPath}`);
+        return {
+            ok: true,
+            path: outputPath,
+            width: IMAGE_WIDTH,
+            height: IMAGE_HEIGHT,
+            nodeCount: nodeRows.length,
+            edgeCount: edges.length,
+            ...(truncated ? { truncated } : {}),
+        };
+    }
+    finally {
+        await session.close();
+    }
+}
+//# sourceMappingURL=graph-render.js.map

package/payload/platform/plugins/graph-viewer/mcp/dist/tools/graph-render.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-render.js","sourceRoot":"","sources":["../../src/tools/graph-render.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAwC,MAAM,qBAAqB,CAAC;AACxF,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C,SAAS,cAAc;IACrB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC;IACzE,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CACb,6GAA6G,CAC9G,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,gBAAgB,CAAC,SAAiB;IACzC,uEAAuE;IACvE,mEAAmE;IACnE,OAAO,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED,MAAM,QAAQ,GAAG,GAAG,CAAC;AACrB,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,MAAM,YAAY,GAAG,GAAG,CAAC;AA0BzB,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,MAAyB;IAEzB,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;IAEjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;QAC5E,OAAO;YACL,EAAE,EAAE,KAAK;YACT,MAAM,EAAE,eAAe;YACvB,OAAO,EAAE,6CAA6C,aAAa,SAAS,MAAM,CAAC,QAAQ,CAAC,GAAG;SAChG,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACtB,MAAM,OAAO,GAAG,UAAU,EAAE,CAAC;IAC7B,IAAI,CAAC;QACH,gEAAgE;QAChE,gEAAgE;QAChE,6DAA6D;QAC7D,4CAA4C;QAC5C,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,GAAG,CACjC;;0EAEoE,EACpE,EAAE,MAAM,EAAE,CACX,CAAC;QACF,IAAI,SAAS,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,CAAC,iCAAiC,SAAS,wBAAwB,MAAM,kBAAkB,CAAC,CAAC;YACpG,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,mBAAmB,MAAM,8BAA8B;aACjE,CAAC;QACJ,CAAC;QACD,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QAChE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,OAAO,CAAC,iCAAiC,SAAS,wBAAwB,MAAM,wBAAwB,CAAC,CAAC;YAC1G,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,QAAQ,MAAM,kCAAkC;aAC1D,CAAC;QACJ,CAAC;QAED,OAAO,CAAC,gCAAgC,SAAS,WAAW,MAAM,aAAa,QAAQ,EAAE,CAAC,CAAC;QAE3F,mEAAmE;QACnE,sEAAsE;QACtE,sEAAsE;QACtE,MAAM,WAAW,GAAG;;iCAES,QAAQ;;;;;;;;;;;;KAYpC,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE;YAC5C,MAAM;YACN,SAAS;YACT,GAAG,EAAE,QAAQ;SACd,CAAC,CAAC;QAEH,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,iCAAiC,SAAS,wBAAwB,MAAM,EAAE,CAAC,CAAC;YACpF,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,oEAAoE;aAC9E,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAIpC,CAAC;QACH,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAIvC,CAAC;QACH,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,OAAO,aAAa,KAAK,QAAQ;YAClD,CAAC,CAAC,aAAa;YACf,CAAC,CAAC,CAAC,aAAa,EAAE,QAAQ,EAAE,EAAE,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAErD,uEAAuE;QACvE,iCAAiC;QACjC,MAAM,KAAK,GAAmB,WAAW;aACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;aACvC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAK,EAAE,CAAC,CAAC,CAAC;QAE7D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,iCAAiC,SAAS,wBAAwB,MAAM,EAAE,CAAC,CAAC;YACpF,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,iDAAiD;aAC3D,CAAC;QACJ,CAAC;QAED,MAAM,WAAW,GAAmB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvD,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;SACjB,CAAC,CAAC,CAAC;QAEJ,MAAM,cAAc,GAA4C,EAAE,CAAC;QACnE,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;QAE9D,MAAM,MAAM,GAAG,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE;YAC7C,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE,YAAY;SACrB,CAAC,CAAC;QAEH,IAAI,SAAiB,CAAC;QACtB,IAAI,CAAC;YACH,SAAS,GAAG,SAAS,CAAC;gBACpB,MAAM;gBACN,cAAc;gBACd,KAAK,EAAE,WAAW;gBAClB,MAAM,EAAE,YAAY;aACrB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,OAAO,CAAC,iCAAiC,SAAS,6BAA6B,MAAM,UAAU,OAAO,EAAE,CAAC,CAAC;YAC1G,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,YAAY;gBACpB,OAAO,EAAE,uBAAuB,OAAO,EAAE;aAC1C,CAAC;QACJ,CAAC;QAED,yEAAyE;QACzE,wEAAwE;QACxE,sEAAsE;QACtE,qEAAqE;QACrE,wEAAwE;QACxE,yEAAyE;QACzE,iEAAiE;QACjE,oDAAoD;QACpD,MAAM,WAAW,GAAG,cAAc,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC5E,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,QAAQ,MAAM,CAAC;QAChE,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAChD,aAAa,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAErC,MAAM,SAAS,GAAG,UAAU,GAAG,QAAQ,CAAC,MAAM;YAC5C,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE;YAClD,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3B,OAAO,CACL,6BAA6B,SAAS,OAAO,EAAE,UAAU,SAAS,CAAC,MAAM,GAAG;YAC1E,aAAa,QAAQ,CAAC,MAAM,cAAc,KAAK,CAAC,MAAM,GAAG;YACzD,aAAa,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,eAAe,MAAM,CAAC,UAAU,GAAG;YAC5E,QAAQ,UAAU,EAAE,CACvB,CAAC;QAEF,OAAO;YACL,EAAE,EAAE,IAAI;YACR,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE,YAAY;YACpB,SAAS,EAAE,QAAQ,CAAC,MAAM;YAC1B,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpC,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;AACH,CAAC"}

package/payload/platform/plugins/graph-viewer/mcp/package.json

@@ -0,0 +1,25 @@
+{
+  "name": "@maxy/graph-viewer",
+  "version": "0.1.0",
+  "private": true,
+  "type": "module",
+  "main": "dist/index.js",
+  "scripts": {
+    "build": "tsc",
+    "start": "node dist/index.js",
+    "test": "vitest run"
+  },
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.12.1",
+    "@napi-rs/canvas": "^0.1.56",
+    "d3-force": "^3.0.0",
+    "neo4j-driver": "^5.28.1",
+    "zod": "^3.23.0"
+  },
+  "devDependencies": {
+    "@types/d3-force": "^3.0.10",
+    "@types/node": "^22.0.0",
+    "typescript": "^5.7.0",
+    "vitest": "^4.1.2"
+  }
+}

package/payload/platform/plugins/graph-viewer/mcp/vitest.config.ts

@@ -0,0 +1,8 @@
+import { defineConfig } from "vitest/config";
+
+export default defineConfig({
+  test: {
+    include: ["src/**/*.test.ts"],
+    environment: "node",
+  },
+});

package/payload/platform/plugins/graph-viewer/skills/render-graph/SKILL.md

@@ -0,0 +1,43 @@
+---
+name: render-graph
+description: "Render an inline PNG of a Neo4j subgraph for the operator using the graph-render MCP tool. Use when the operator asks to 'see the graph', 'show me the subgraph around X', 'render the owner subgraph', or any request whose outcome is a picture of nodes-and-edges they can look at in chat. Never substitute Mermaid, ASCII, or any other graph stand-in: graph-render is the only correct surface, and if it refuses (foreign account, missing node, empty neighbourhood, draw error) surface the structured error to the operator and stop. The image uses the same palette and short-label strings as the admin /graph page; node positions will differ because the renderer is d3-force not vis-network."
+---
+
+# render-graph
+
+Invoked by the admin agent directly.
+
+When the operator asks for a picture of a subgraph:
+
+1. Resolve the root node's `elementId` first — usually via `memory-search`
+   or another graph tool the operator already pointed you at. Never pass a
+   property like `name` as `nodeId`.
+2. Pick a `hopDepth` between 0 and 3. Default to 1 unless the operator
+   asks for the wider neighbourhood. Depth 3 on a busy node will hit the
+   200-node cap and return a `truncated` envelope.
+3. Call `graph-render` with `{ accountId, nodeId, hopDepth }`.
+4. If the result is `ok: true`, the PNG is at the returned `path` under
+   `output/graph-render/`. The render is not shown inline, so deliver it by
+   surface: on a message channel (web chat, WhatsApp, Telegram) call
+   `SendUserFile` with that path and the platform forwards the PNG to that
+   conversation as a real attachment; on the admin dashboard the same path
+   appears in the Artefacts panel (downloadable) and is reachable on the
+   file share. Either way, state that exact path in your reply. Add a
+   one-line caption, say how many nodes are in view, and — if `truncated`
+   is present — that there were more nodes than the cap.
+5. If the result is `ok: false`, surface the structured `reason` and
+   `message` to the operator verbatim. Do not retry with a different
+   nodeId without their input. Do not fall back to Mermaid, ASCII, or any
+   other graph substitute.
+
+## Reasons graph-render can refuse
+
+- `scope` — the nodeId belongs to a different account, or does not exist.
+- `empty` — the root exists but its neighbourhood is empty after the
+  trash filter.
+- `cap-exceeded` — reserved for future use; today subgraphs above 200
+  nodes return `ok: true` with a `truncated` envelope.
+- `draw-error` — the canvas renderer failed. The message contains the
+  underlying error; if it mentions a missing font, the system font fallback
+  is unavailable on this device.
+- `invalid-input` — `hopDepth` was outside the 0-3 range.

package/payload/platform/plugins/linkedin-extension/.claude-plugin/plugin.json

@@ -0,0 +1,8 @@
+{
+  "name": "linkedin-extension",
+  "description": "One-click LinkedIn ingest. Ships a manifest-v3 Chrome extension that injects an Add-to-SiteDesk pill into `linkedin.com/in/*` profiles and `linkedin.com/messaging/thread/*` DM threads. Each click scrapes the page DOM, POSTs to the admin `linkedin-ingest` route, which dispatches `database-operator` against the generic `document-ingest` skill. The plugin is the **first consumer** of the generic communication-ingest path; every future communication surface (email, Telegram, WhatsApp, group chats, voice memos) plugs into the same backend. Opt-in per brand.",
+  "version": "0.1.0",
+  "author": {
+    "name": "Rubytech LLC"
+  }
+}