@fusedashlabs/widgets 0.2.0 → 0.3.1

package/dist/components/network-graph/lib/format.js

@@ -0,0 +1,29 @@
+function formatLinkValue(value) {
+  const n = Number(value ?? 0);
+  if (n >= 1e3) {
+    const k = n / 1e3;
+    return `${Number.isInteger(k) ? k.toString() : k.toFixed(1)}K`;
+  }
+  return n.toString();
+}
+function formatNodeValue(value) {
+  return typeof value === "number" ? `$${value.toFixed(2)}` : "";
+}
+function formatLegendValue(value, toFixed = 0) {
+  if (!Number.isFinite(value)) return "0";
+  if (Math.abs(value) < 1e3) return value.toFixed(toFixed);
+  const abbreviations = ["B", "M", "K"];
+  for (let i = 0; i < abbreviations.length; i++) {
+    const unit = Math.pow(1e3, abbreviations.length - i);
+    if (Math.abs(value) >= unit) {
+      return `${(value / unit).toFixed(1)} ${abbreviations[i]}`;
+    }
+  }
+  return value.toFixed(toFixed);
+}
+export {
+  formatLegendValue,
+  formatLinkValue,
+  formatNodeValue
+};
+//# sourceMappingURL=format.js.map

package/dist/components/network-graph/lib/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sources":["../../../../src/components/network-graph/lib/format.ts"],"sourcesContent":["/** Client `toK` — link label text. */\nexport function formatLinkValue(value: number | undefined): string {\n  const n = Number(value ?? 0);\n  if (n >= 1000) {\n    const k = n / 1000;\n    return `${Number.isInteger(k) ? k.toString() : k.toFixed(1)}K`;\n  }\n  return n.toString();\n}\n\n/** Client node label value row. */\nexport function formatNodeValue(value: number | undefined): string {\n  return typeof value === 'number' ? `$${value.toFixed(2)}` : '';\n}\n\n/** Client `Legends.formatValue` — abbreviated bucket boundary. */\nexport function formatLegendValue(value: number, toFixed = 0): string {\n  if (!Number.isFinite(value)) return '0';\n  if (Math.abs(value) < 1000) return value.toFixed(toFixed);\n\n  const abbreviations = ['B', 'M', 'K'];\n  for (let i = 0; i < abbreviations.length; i++) {\n    const unit = Math.pow(1000, abbreviations.length - i);\n    if (Math.abs(value) >= unit) {\n      return `${(value / unit).toFixed(1)} ${abbreviations[i]}`;\n    }\n  }\n  return value.toFixed(toFixed);\n}\n"],"names":[],"mappings":"AACO,SAAS,gBAAgB,OAAmC;AACjE,QAAM,IAAI,OAAO,SAAS,CAAC;AAC3B,MAAI,KAAK,KAAM;AACb,UAAM,IAAI,IAAI;AACd,WAAO,GAAG,OAAO,UAAU,CAAC,IAAI,EAAE,SAAA,IAAa,EAAE,QAAQ,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO,EAAE,SAAA;AACX;AAGO,SAAS,gBAAgB,OAAmC;AACjE,SAAO,OAAO,UAAU,WAAW,IAAI,MAAM,QAAQ,CAAC,CAAC,KAAK;AAC9D;AAGO,SAAS,kBAAkB,OAAe,UAAU,GAAW;AACpE,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,MAAI,KAAK,IAAI,KAAK,IAAI,IAAM,QAAO,MAAM,QAAQ,OAAO;AAExD,QAAM,gBAAgB,CAAC,KAAK,KAAK,GAAG;AACpC,WAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAM,OAAO,KAAK,IAAI,KAAM,cAAc,SAAS,CAAC;AACpD,QAAI,KAAK,IAAI,KAAK,KAAK,MAAM;AAC3B,aAAO,IAAI,QAAQ,MAAM,QAAQ,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC;AAAA,IACzD;AAAA,EACF;AACA,SAAO,MAAM,QAAQ,OAAO;AAC9B;"}

package/dist/components/network-graph/lib/index.d.ts

@@ -0,0 +1,5 @@
+export { type NetworkGraphFusePayload, type NetworkGraphInput, type NetworkGraphModel, type NetworkGraphPayload, type NetworkLegendRange, type NetworkLink, type NetworkLinkKind, type NetworkNode, type NetworkRange, type NetworkSizeKey, } from './types.js';
+export { MAX_NETWORK_LINKS, MAX_NETWORK_NODES, normalizeNetworkGraphData, } from './normalize.js';
+export { DEFAULT_NODE_COLOR, FULL_RANGE, INITIAL_NODE_RADIUS_RATIO, LABEL_ALWAYS_ABOVE, LINK_COLORS, LINK_LABEL_COLORS, LINK_WIDTH, NODE_BORDER_WIDTH, NODE_COLORS, NODE_LABEL_COLORS, NODE_SIZES, NODE_TYPE_COLORS, SHADOW_RADIUS_RATIO, SIZE_KEYS, isFullRange, legendRanges, networkForces, nodeColor, nodeRadius, nodeSizeKey, rangeIndexOf, scaleLinkWidthByMax, shadowRadius, visibleNodeIds, type NetworkForces, } from './domain.js';
+export { formatLegendValue, formatLinkValue, formatNodeValue, } from './format.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/components/network-graph/lib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/components/network-graph/lib/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,uBAAuB,EAC5B,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,EACvB,KAAK,WAAW,EAChB,KAAK,eAAe,EACpB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,cAAc,GACpB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,yBAAyB,GAC1B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,kBAAkB,EAClB,UAAU,EACV,yBAAyB,EACzB,kBAAkB,EAClB,WAAW,EACX,iBAAiB,EACjB,UAAU,EACV,iBAAiB,EACjB,WAAW,EACX,iBAAiB,EACjB,UAAU,EACV,gBAAgB,EAChB,mBAAmB,EACnB,SAAS,EACT,WAAW,EACX,YAAY,EACZ,aAAa,EACb,SAAS,EACT,UAAU,EACV,WAAW,EACX,YAAY,EACZ,mBAAmB,EACnB,YAAY,EACZ,cAAc,EACd,KAAK,aAAa,GACnB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,eAAe,GAChB,MAAM,aAAa,CAAC"}

package/dist/components/network-graph/lib/normalize.d.ts

@@ -0,0 +1,10 @@
+import { NetworkGraphInput, NetworkGraphModel } from './types.js';
+/**
+ * Mark caps for chat: a node costs eight SVG elements plus a label, a link
+ * costs a line plus a label pill. Denser payloads keep their largest members.
+ */
+export declare const MAX_NETWORK_NODES = 250;
+export declare const MAX_NETWORK_LINKS = 600;
+/** Normalize FuseDash widget or chat payloads into a force-graph model. */
+export declare function normalizeNetworkGraphData(input: NetworkGraphInput | null | undefined): NetworkGraphModel;
+//# sourceMappingURL=normalize.d.ts.map

package/dist/components/network-graph/lib/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../../src/components/network-graph/lib/normalize.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAEV,iBAAiB,EACjB,iBAAiB,EAIlB,MAAM,YAAY,CAAC;AAEpB;;;GAGG;AACH,eAAO,MAAM,iBAAiB,MAAM,CAAC;AACrC,eAAO,MAAM,iBAAiB,MAAM,CAAC;AAgKrC,2EAA2E;AAC3E,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,GAC1C,iBAAiB,CAiBnB"}

package/dist/components/network-graph/lib/normalize.js

@@ -0,0 +1,140 @@
+import { generateBreakPoints } from "../../../utils/breakpoints.js";
+import { pickQualitativePalette } from "../../../utils/fuse-palette.js";
+import { NODE_TYPE_COLORS } from "./domain.js";
+const MAX_NETWORK_NODES = 250;
+const MAX_NETWORK_LINKS = 600;
+const LINK_KINDS = ["primary", "neutral", "secondary"];
+const EMPTY_MODEL = {
+  nodes: [],
+  links: [],
+  breakpoints: [],
+  maxLinkValue: 1
+};
+function emptyModel() {
+  return { ...EMPTY_MODEL, nodes: [], links: [], breakpoints: [] };
+}
+function isRecord(value) {
+  return !!value && typeof value === "object" && !Array.isArray(value);
+}
+function optionalString(value) {
+  return typeof value === "string" && value.trim() ? value : void 0;
+}
+function finiteNumber(value) {
+  const n = typeof value === "number" ? value : Number(value);
+  return Number.isFinite(n) ? n : void 0;
+}
+function toNode(raw) {
+  if (!isRecord(raw)) return null;
+  const id = raw.id == null ? "" : String(raw.id);
+  if (!id) return null;
+  return {
+    id,
+    label: optionalString(raw.label) ?? id,
+    value: finiteNumber(raw.value),
+    type: raw.type == null ? "" : String(raw.type),
+    color: optionalString(raw.color),
+    img: optionalString(raw.img)
+  };
+}
+function toLinkKind(raw) {
+  return LINK_KINDS.includes(raw) ? raw : "neutral";
+}
+function collectNodes(raw) {
+  const byId = /* @__PURE__ */ new Map();
+  for (const entry of raw) {
+    const node = toNode(entry);
+    if (node && !byId.has(node.id)) byId.set(node.id, node);
+  }
+  const nodes = [...byId.values()];
+  if (nodes.length <= MAX_NETWORK_NODES) return nodes;
+  return nodes.slice().sort((a, b) => (b.value ?? 0) - (a.value ?? 0)).slice(0, MAX_NETWORK_NODES);
+}
+function collectLinks(raw, known) {
+  const seen = /* @__PURE__ */ new Set();
+  const links = [];
+  raw.forEach((entry, index) => {
+    if (!isRecord(entry)) return;
+    const source = entry.source == null ? "" : String(entry.source);
+    const target = entry.target == null ? "" : String(entry.target);
+    if (!source || !target || source === target) return;
+    if (!known.has(source) || !known.has(target)) return;
+    const id = entry.id == null ? `${source}->${target}-${index}` : String(entry.id);
+    if (seen.has(id)) return;
+    seen.add(id);
+    links.push({
+      id,
+      source,
+      target,
+      value: finiteNumber(entry.value) ?? 0,
+      type: toLinkKind(entry.type)
+    });
+  });
+  if (links.length <= MAX_NETWORK_LINKS) return links;
+  return links.slice().sort((a, b) => b.value - a.value).slice(0, MAX_NETWORK_LINKS);
+}
+function paintUnknownTypes(nodes) {
+  const unknown = [];
+  for (const node of nodes) {
+    if (!node.type || NODE_TYPE_COLORS[node.type] || unknown.includes(node.type)) continue;
+    unknown.push(node.type);
+  }
+  if (!unknown.length) return;
+  const palette = pickQualitativePalette(0, unknown.length);
+  for (const node of nodes) {
+    if (node.color) continue;
+    const index = unknown.indexOf(node.type);
+    if (index >= 0) node.color = palette[index % palette.length];
+  }
+}
+function buildModel(rawNodes, rawLinks) {
+  let nodes = collectNodes(rawNodes);
+  if (!nodes.length) {
+    const derived = /* @__PURE__ */ new Map();
+    for (const entry of rawLinks) {
+      if (!isRecord(entry)) continue;
+      for (const key of ["source", "target"]) {
+        const id = entry[key] == null ? "" : String(entry[key]);
+        if (id && !derived.has(id)) derived.set(id, { id, label: id, type: "" });
+      }
+    }
+    nodes = collectNodes([...derived.values()]);
+  }
+  if (!nodes.length) return emptyModel();
+  paintUnknownTypes(nodes);
+  const links = collectLinks(rawLinks, new Set(nodes.map((n) => n.id)));
+  const values = nodes.map((n) => n.value).filter((v) => typeof v === "number");
+  return {
+    nodes,
+    links,
+    breakpoints: values.length ? generateBreakPoints(values, 7) : [],
+    maxLinkValue: links.reduce((max, l) => Math.max(max, l.value), 0) || 1
+  };
+}
+function normalizeFuse(payload) {
+  const first = Array.isArray(payload.data) ? payload.data[0] : void 0;
+  if (!isRecord(first)) return emptyModel();
+  return buildModel(
+    Array.isArray(first.nodes) ? first.nodes : [],
+    Array.isArray(first.links) ? first.links : []
+  );
+}
+function normalizeNetworkGraphData(input) {
+  if (!input) return emptyModel();
+  if (Array.isArray(input)) return buildModel([], input);
+  if (isRecord(input) && (Array.isArray(input.nodes) || Array.isArray(input.links))) {
+    return buildModel(
+      Array.isArray(input.nodes) ? input.nodes : [],
+      Array.isArray(input.links) ? input.links : []
+    );
+  }
+  if (isRecord(input) && Array.isArray(input.data)) {
+    return normalizeFuse(input);
+  }
+  return emptyModel();
+}
+export {
+  MAX_NETWORK_LINKS,
+  MAX_NETWORK_NODES,
+  normalizeNetworkGraphData
+};
+//# sourceMappingURL=normalize.js.map

package/dist/components/network-graph/lib/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sources":["../../../../src/components/network-graph/lib/normalize.ts"],"sourcesContent":["import { generateBreakPoints } from '../../../utils/breakpoints.js';\nimport { pickQualitativePalette } from '../../../utils/fuse-palette.js';\n\nimport { NODE_TYPE_COLORS } from './domain.js';\n\nimport type {\n  NetworkGraphFusePayload,\n  NetworkGraphInput,\n  NetworkGraphModel,\n  NetworkLink,\n  NetworkLinkKind,\n  NetworkNode,\n} from './types.js';\n\n/**\n * Mark caps for chat: a node costs eight SVG elements plus a label, a link\n * costs a line plus a label pill. Denser payloads keep their largest members.\n */\nexport const MAX_NETWORK_NODES = 250;\nexport const MAX_NETWORK_LINKS = 600;\n\nconst LINK_KINDS: NetworkLinkKind[] = ['primary', 'neutral', 'secondary'];\n\nconst EMPTY_MODEL: NetworkGraphModel = {\n  nodes: [],\n  links: [],\n  breakpoints: [],\n  maxLinkValue: 1,\n};\n\nfunction emptyModel(): NetworkGraphModel {\n  return { ...EMPTY_MODEL, nodes: [], links: [], breakpoints: [] };\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return !!value && typeof value === 'object' && !Array.isArray(value);\n}\n\nfunction optionalString(value: unknown): string | undefined {\n  return typeof value === 'string' && value.trim() ? value : undefined;\n}\n\nfunction finiteNumber(value: unknown): number | undefined {\n  const n = typeof value === 'number' ? value : Number(value);\n  return Number.isFinite(n) ? n : undefined;\n}\n\nfunction toNode(raw: unknown): NetworkNode | null {\n  if (!isRecord(raw)) return null;\n  const id = raw.id == null ? '' : String(raw.id);\n  if (!id) return null;\n  return {\n    id,\n    label: optionalString(raw.label) ?? id,\n    value: finiteNumber(raw.value),\n    type: raw.type == null ? '' : String(raw.type),\n    color: optionalString(raw.color),\n    img: optionalString(raw.img),\n  };\n}\n\nfunction toLinkKind(raw: unknown): NetworkLinkKind {\n  return LINK_KINDS.includes(raw as NetworkLinkKind)\n    ? (raw as NetworkLinkKind)\n    : 'neutral';\n}\n\nfunction collectNodes(raw: unknown[]): NetworkNode[] {\n  const byId = new Map<string, NetworkNode>();\n  for (const entry of raw) {\n    const node = toNode(entry);\n    if (node && !byId.has(node.id)) byId.set(node.id, node);\n  }\n  const nodes = [...byId.values()];\n  if (nodes.length <= MAX_NETWORK_NODES) return nodes;\n  return nodes\n    .slice()\n    .sort((a, b) => (b.value ?? 0) - (a.value ?? 0))\n    .slice(0, MAX_NETWORK_NODES);\n}\n\nfunction collectLinks(raw: unknown[], known: Set<string>): NetworkLink[] {\n  const seen = new Set<string>();\n  const links: NetworkLink[] = [];\n\n  raw.forEach((entry, index) => {\n    if (!isRecord(entry)) return;\n    const source = entry.source == null ? '' : String(entry.source);\n    const target = entry.target == null ? '' : String(entry.target);\n    // A self link draws as a zero-length stroke — it costs marks and shows\n    // nothing, so it never reaches the plot.\n    if (!source || !target || source === target) return;\n    if (!known.has(source) || !known.has(target)) return;\n\n    const id = entry.id == null ? `${source}->${target}-${index}` : String(entry.id);\n    if (seen.has(id)) return;\n    seen.add(id);\n\n    links.push({\n      id,\n      source,\n      target,\n      value: finiteNumber(entry.value) ?? 0,\n      type: toLinkKind(entry.type),\n    });\n  });\n\n  if (links.length <= MAX_NETWORK_LINKS) return links;\n  return links\n    .slice()\n    .sort((a, b) => b.value - a.value)\n    .slice(0, MAX_NETWORK_LINKS);\n}\n\n/**\n * `NODE_TYPE_COLORS` only covers the categories the client ships. Anything else\n * (the default mock's `investment_bank`, `asset_management`, …) would collapse\n * onto one slate fill, so unknown categories draw from the qualitative palette\n * in first-seen order instead.\n */\nfunction paintUnknownTypes(nodes: NetworkNode[]): void {\n  const unknown: string[] = [];\n  for (const node of nodes) {\n    if (!node.type || NODE_TYPE_COLORS[node.type] || unknown.includes(node.type)) continue;\n    unknown.push(node.type);\n  }\n  if (!unknown.length) return;\n\n  const palette = pickQualitativePalette(0, unknown.length);\n  for (const node of nodes) {\n    if (node.color) continue;\n    const index = unknown.indexOf(node.type);\n    if (index >= 0) node.color = palette[index % palette.length];\n  }\n}\n\nfunction buildModel(rawNodes: unknown[], rawLinks: unknown[]): NetworkGraphModel {\n  let nodes = collectNodes(rawNodes);\n\n  if (!nodes.length) {\n    // Links-only payloads describe their own endpoints.\n    const derived = new Map<string, NetworkNode>();\n    for (const entry of rawLinks) {\n      if (!isRecord(entry)) continue;\n      for (const key of ['source', 'target'] as const) {\n        const id = entry[key] == null ? '' : String(entry[key]);\n        if (id && !derived.has(id)) derived.set(id, { id, label: id, type: '' });\n      }\n    }\n    nodes = collectNodes([...derived.values()]);\n  }\n\n  if (!nodes.length) return emptyModel();\n\n  paintUnknownTypes(nodes);\n\n  const links = collectLinks(rawLinks, new Set(nodes.map((n) => n.id)));\n  const values = nodes\n    .map((n) => n.value)\n    .filter((v): v is number => typeof v === 'number');\n\n  return {\n    nodes,\n    links,\n    breakpoints: values.length ? generateBreakPoints(values, 7) : [],\n    maxLinkValue: links.reduce((max, l) => Math.max(max, l.value), 0) || 1,\n  };\n}\n\n/** Client `extractGraphDataFromWidget` — the graph lives in `widget.data[0]`. */\nfunction normalizeFuse(payload: NetworkGraphFusePayload): NetworkGraphModel {\n  const first = Array.isArray(payload.data) ? payload.data[0] : undefined;\n  if (!isRecord(first)) return emptyModel();\n  return buildModel(\n    Array.isArray(first.nodes) ? first.nodes : [],\n    Array.isArray(first.links) ? first.links : [],\n  );\n}\n\n/** Normalize FuseDash widget or chat payloads into a force-graph model. */\nexport function normalizeNetworkGraphData(\n  input: NetworkGraphInput | null | undefined,\n): NetworkGraphModel {\n  if (!input) return emptyModel();\n\n  if (Array.isArray(input)) return buildModel([], input);\n\n  if (isRecord(input) && (Array.isArray(input.nodes) || Array.isArray(input.links))) {\n    return buildModel(\n      Array.isArray(input.nodes) ? input.nodes : [],\n      Array.isArray(input.links) ? input.links : [],\n    );\n  }\n\n  if (isRecord(input) && Array.isArray(input.data)) {\n    return normalizeFuse(input as NetworkGraphFusePayload);\n  }\n\n  return emptyModel();\n}\n"],"names":[],"mappings":";;;AAkBO,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAEjC,MAAM,aAAgC,CAAC,WAAW,WAAW,WAAW;AAExE,MAAM,cAAiC;AAAA,EACrC,OAAO,CAAA;AAAA,EACP,OAAO,CAAA;AAAA,EACP,aAAa,CAAA;AAAA,EACb,cAAc;AAChB;AAEA,SAAS,aAAgC;AACvC,SAAO,EAAE,GAAG,aAAa,OAAO,CAAA,GAAI,OAAO,CAAA,GAAI,aAAa,GAAC;AAC/D;AAEA,SAAS,SAAS,OAAkD;AAClE,SAAO,CAAC,CAAC,SAAS,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AACrE;AAEA,SAAS,eAAe,OAAoC;AAC1D,SAAO,OAAO,UAAU,YAAY,MAAM,KAAA,IAAS,QAAQ;AAC7D;AAEA,SAAS,aAAa,OAAoC;AACxD,QAAM,IAAI,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC1D,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAEA,SAAS,OAAO,KAAkC;AAChD,MAAI,CAAC,SAAS,GAAG,EAAG,QAAO;AAC3B,QAAM,KAAK,IAAI,MAAM,OAAO,KAAK,OAAO,IAAI,EAAE;AAC9C,MAAI,CAAC,GAAI,QAAO;AAChB,SAAO;AAAA,IACL;AAAA,IACA,OAAO,eAAe,IAAI,KAAK,KAAK;AAAA,IACpC,OAAO,aAAa,IAAI,KAAK;AAAA,IAC7B,MAAM,IAAI,QAAQ,OAAO,KAAK,OAAO,IAAI,IAAI;AAAA,IAC7C,OAAO,eAAe,IAAI,KAAK;AAAA,IAC/B,KAAK,eAAe,IAAI,GAAG;AAAA,EAAA;AAE/B;AAEA,SAAS,WAAW,KAA+B;AACjD,SAAO,WAAW,SAAS,GAAsB,IAC5C,MACD;AACN;AAEA,SAAS,aAAa,KAA+B;AACnD,QAAM,2BAAW,IAAA;AACjB,aAAW,SAAS,KAAK;AACvB,UAAM,OAAO,OAAO,KAAK;AACzB,QAAI,QAAQ,CAAC,KAAK,IAAI,KAAK,EAAE,EAAG,MAAK,IAAI,KAAK,IAAI,IAAI;AAAA,EACxD;AACA,QAAM,QAAQ,CAAC,GAAG,KAAK,QAAQ;AAC/B,MAAI,MAAM,UAAU,kBAAmB,QAAO;AAC9C,SAAO,MACJ,QACA,KAAK,CAAC,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE,EAC9C,MAAM,GAAG,iBAAiB;AAC/B;AAEA,SAAS,aAAa,KAAgB,OAAmC;AACvE,QAAM,2BAAW,IAAA;AACjB,QAAM,QAAuB,CAAA;AAE7B,MAAI,QAAQ,CAAC,OAAO,UAAU;AAC5B,QAAI,CAAC,SAAS,KAAK,EAAG;AACtB,UAAM,SAAS,MAAM,UAAU,OAAO,KAAK,OAAO,MAAM,MAAM;AAC9D,UAAM,SAAS,MAAM,UAAU,OAAO,KAAK,OAAO,MAAM,MAAM;AAG9D,QAAI,CAAC,UAAU,CAAC,UAAU,WAAW,OAAQ;AAC7C,QAAI,CAAC,MAAM,IAAI,MAAM,KAAK,CAAC,MAAM,IAAI,MAAM,EAAG;AAE9C,UAAM,KAAK,MAAM,MAAM,OAAO,GAAG,MAAM,KAAK,MAAM,IAAI,KAAK,KAAK,OAAO,MAAM,EAAE;AAC/E,QAAI,KAAK,IAAI,EAAE,EAAG;AAClB,SAAK,IAAI,EAAE;AAEX,UAAM,KAAK;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,aAAa,MAAM,KAAK,KAAK;AAAA,MACpC,MAAM,WAAW,MAAM,IAAI;AAAA,IAAA,CAC5B;AAAA,EACH,CAAC;AAED,MAAI,MAAM,UAAU,kBAAmB,QAAO;AAC9C,SAAO,MACJ,MAAA,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,iBAAiB;AAC/B;AAQA,SAAS,kBAAkB,OAA4B;AACrD,QAAM,UAAoB,CAAA;AAC1B,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,KAAK,QAAQ,iBAAiB,KAAK,IAAI,KAAK,QAAQ,SAAS,KAAK,IAAI,EAAG;AAC9E,YAAQ,KAAK,KAAK,IAAI;AAAA,EACxB;AACA,MAAI,CAAC,QAAQ,OAAQ;AAErB,QAAM,UAAU,uBAAuB,GAAG,QAAQ,MAAM;AACxD,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,MAAO;AAChB,UAAM,QAAQ,QAAQ,QAAQ,KAAK,IAAI;AACvC,QAAI,SAAS,EAAG,MAAK,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAAA,EAC7D;AACF;AAEA,SAAS,WAAW,UAAqB,UAAwC;AAC/E,MAAI,QAAQ,aAAa,QAAQ;AAEjC,MAAI,CAAC,MAAM,QAAQ;AAEjB,UAAM,8BAAc,IAAA;AACpB,eAAW,SAAS,UAAU;AAC5B,UAAI,CAAC,SAAS,KAAK,EAAG;AACtB,iBAAW,OAAO,CAAC,UAAU,QAAQ,GAAY;AAC/C,cAAM,KAAK,MAAM,GAAG,KAAK,OAAO,KAAK,OAAO,MAAM,GAAG,CAAC;AACtD,YAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAG,SAAQ,IAAI,IAAI,EAAE,IAAI,OAAO,IAAI,MAAM,IAAI;AAAA,MACzE;AAAA,IACF;AACA,YAAQ,aAAa,CAAC,GAAG,QAAQ,OAAA,CAAQ,CAAC;AAAA,EAC5C;AAEA,MAAI,CAAC,MAAM,OAAQ,QAAO,WAAA;AAE1B,oBAAkB,KAAK;AAEvB,QAAM,QAAQ,aAAa,UAAU,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AACpE,QAAM,SAAS,MACZ,IAAI,CAAC,MAAM,EAAE,KAAK,EAClB,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,aAAa,OAAO,SAAS,oBAAoB,QAAQ,CAAC,IAAI,CAAA;AAAA,IAC9D,cAAc,MAAM,OAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,KAAK,GAAG,CAAC,KAAK;AAAA,EAAA;AAEzE;AAGA,SAAS,cAAc,SAAqD;AAC1E,QAAM,QAAQ,MAAM,QAAQ,QAAQ,IAAI,IAAI,QAAQ,KAAK,CAAC,IAAI;AAC9D,MAAI,CAAC,SAAS,KAAK,UAAU,WAAA;AAC7B,SAAO;AAAA,IACL,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,IAC3C,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,EAAC;AAEhD;AAGO,SAAS,0BACd,OACmB;AACnB,MAAI,CAAC,MAAO,QAAO,WAAA;AAEnB,MAAI,MAAM,QAAQ,KAAK,UAAU,WAAW,CAAA,GAAI,KAAK;AAErD,MAAI,SAAS,KAAK,MAAM,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,QAAQ,MAAM,KAAK,IAAI;AACjF,WAAO;AAAA,MACL,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,MAC3C,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,IAAC;AAAA,EAEhD;AAEA,MAAI,SAAS,KAAK,KAAK,MAAM,QAAQ,MAAM,IAAI,GAAG;AAChD,WAAO,cAAc,KAAgC;AAAA,EACvD;AAEA,SAAO,WAAA;AACT;"}

package/dist/components/network-graph/lib/types.d.ts

@@ -0,0 +1,56 @@
+/** Node size buckets, smallest → largest (client `SIZE_KEYS`). */
+export type NetworkSizeKey = 'xs' | 'sm' | 'md' | 'lg' | 'xl' | '2xl' | '3xl';
+/** Link stroke palette key (client `LINK_COLORS`). */
+export type NetworkLinkKind = 'primary' | 'neutral' | 'secondary';
+export interface NetworkNode {
+    id: string;
+    /** Drawn as the label title; falls back to the id. */
+    label: string;
+    /** Drives the size bucket and the label's value row. */
+    value?: number;
+    /** Category key resolved through `NODE_TYPE_COLORS`. */
+    type: string;
+    /** Explicit colour — wins over `type`. */
+    color?: string;
+    /** Avatar URL, clipped to the node circle. */
+    img?: string;
+}
+export interface NetworkLink {
+    id: string;
+    source: string;
+    target: string;
+    /** Label text and, while the link is active, its stroke width. */
+    value: number;
+    type: NetworkLinkKind;
+}
+export interface NetworkGraphModel {
+    nodes: NetworkNode[];
+    links: NetworkLink[];
+    /** Seven quantile breaks over node values — size buckets and legend rows. */
+    breakpoints: number[];
+    /** Largest link value; active links scale their width against it. */
+    maxLinkValue: number;
+}
+/** Legend bucket: a value range and the node radius it stands for. */
+export interface NetworkLegendRange {
+    start: number;
+    end: number;
+    radius: number;
+}
+/** Inclusive-left, exclusive-right bucket window from the legend slider. */
+export interface NetworkRange {
+    leftSlider: number;
+    rightSlider: number;
+}
+/** Chat payload that already describes the graph. */
+export interface NetworkGraphPayload {
+    nodes?: unknown[];
+    links?: unknown[];
+}
+/** FuseDash widget payload — the graph lives in `data[0]`. */
+export interface NetworkGraphFusePayload {
+    data?: unknown;
+    name?: string;
+}
+export type NetworkGraphInput = NetworkGraphPayload | NetworkGraphFusePayload | unknown[];
+//# sourceMappingURL=types.d.ts.map

package/dist/components/network-graph/lib/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/components/network-graph/lib/types.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;AAE9E,sDAAsD;AACtD,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,CAAC;AAElE,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,sDAAsD;IACtD,KAAK,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,wDAAwD;IACxD,IAAI,EAAE,MAAM,CAAC;IACb,0CAA0C;IAC1C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,eAAe,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,6EAA6E;IAC7E,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,qEAAqE;IACrE,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,sEAAsE;AACtE,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,4EAA4E;AAC5E,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,qDAAqD;AACrD,MAAM,WAAW,mBAAmB;IAClC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;CACnB;AAED,8DAA8D;AAC9D,MAAM,WAAW,uBAAuB;IACtC,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,MAAM,iBAAiB,GACzB,mBAAmB,GACnB,uBAAuB,GACvB,OAAO,EAAE,CAAC"}

package/dist/components/network-graph/metadata.json.d.ts

@@ -0,0 +1,91 @@
+declare const _default: {
+  "id": "network-graph",
+  "tag": "ui9000-network-graph",
+  "title": "Network Graph",
+  "description": "Chat-optimized FuseDash NetworkGraph rewritten in D3 (d3-force/-drag/-zoom). Value-sized nodes, category colours, click-to-focus links, and a size-bucket legend filter. No Redux.",
+  "chartTypeKeys": ["networkGraphChart"],
+  "source": "client/libs/shared/components/src/Widgets/NetworkGraph/",
+  "stack": "d3",
+  "lazyImport": "@fusedashlabs/widgets/lazy/network-graph",
+  "entry": "@fusedashlabs/widgets/network-graph",
+  "usageConditions": {
+    "host": "mcp-chat",
+    "notFor": "fusedash-editor",
+    "mapsExcluded": true
+  },
+  "allowedActions": ["hover", "select", "drag", "zoom", "filter", "resize"],
+  "propsSchema": {
+    "$schema": "https://json-schema.org/draft/2020-12/schema",
+    "type": "object",
+    "properties": {
+      "data": {
+        "oneOf": [
+          {
+            "type": "object",
+            "description": "FuseDash WidgetItem-shaped payload — the graph lives in data[0].",
+            "required": ["data"],
+            "properties": {
+              "name": { "type": "string" },
+              "data": {
+                "type": "array",
+                "items": {
+                  "type": "object",
+                  "properties": {
+                    "nodes": { "type": "array", "items": { "$ref": "#/$defs/node" } },
+                    "links": { "type": "array", "items": { "$ref": "#/$defs/link" } }
+                  }
+                }
+              }
+            }
+          },
+          {
+            "type": "object",
+            "description": "Graph payload from chat.",
+            "properties": {
+              "nodes": { "type": "array", "items": { "$ref": "#/$defs/node" } },
+              "links": { "type": "array", "items": { "$ref": "#/$defs/link" } }
+            }
+          },
+          {
+            "type": "array",
+            "description": "Links only — node ids are derived from the endpoints.",
+            "items": { "$ref": "#/$defs/link" }
+          }
+        ]
+      },
+      "chart-title": { "type": "string" },
+      "show-header": { "type": "boolean", "default": true },
+      "show-legend": { "type": "boolean", "default": true },
+      "show-tooltip": { "type": "boolean", "default": true }
+    },
+    "required": ["data"],
+    "$defs": {
+      "node": {
+        "type": "object",
+        "required": ["id"],
+        "properties": {
+          "id": { "type": "string" },
+          "label": { "type": "string" },
+          "value": { "type": "number", "description": "Drives the size bucket." },
+          "type": { "type": "string", "description": "Category key → node colour." },
+          "color": { "type": "string" },
+          "img": { "type": "string", "description": "Avatar URL clipped to the node circle." }
+        }
+      },
+      "link": {
+        "type": "object",
+        "required": ["source", "target"],
+        "properties": {
+          "id": { "type": "string" },
+          "source": { "type": "string" },
+          "target": { "type": "string" },
+          "value": { "type": "number" },
+          "type": { "type": "string", "enum": ["primary", "neutral", "secondary"] }
+        }
+      }
+    }
+  }
+}
+;
+
+export default _default;

package/dist/components/network-graph/metadata.json.js

@@ -0,0 +1,42 @@
+const id = "network-graph";
+const tag = "ui9000-network-graph";
+const title = "Network Graph";
+const description = "Chat-optimized FuseDash NetworkGraph rewritten in D3 (d3-force/-drag/-zoom). Value-sized nodes, category colours, click-to-focus links, and a size-bucket legend filter. No Redux.";
+const chartTypeKeys = ["networkGraphChart"];
+const source = "client/libs/shared/components/src/Widgets/NetworkGraph/";
+const stack = "d3";
+const lazyImport = "@fusedashlabs/widgets/lazy/network-graph";
+const entry = "@fusedashlabs/widgets/network-graph";
+const usageConditions = { "host": "mcp-chat", "notFor": "fusedash-editor", "mapsExcluded": true };
+const allowedActions = ["hover", "select", "drag", "zoom", "filter", "resize"];
+const propsSchema = { "$schema": "https://json-schema.org/draft/2020-12/schema", "type": "object", "properties": { "data": { "oneOf": [{ "type": "object", "description": "FuseDash WidgetItem-shaped payload — the graph lives in data[0].", "required": ["data"], "properties": { "name": { "type": "string" }, "data": { "type": "array", "items": { "type": "object", "properties": { "nodes": { "type": "array", "items": { "$ref": "#/$defs/node" } }, "links": { "type": "array", "items": { "$ref": "#/$defs/link" } } } } } } }, { "type": "object", "description": "Graph payload from chat.", "properties": { "nodes": { "type": "array", "items": { "$ref": "#/$defs/node" } }, "links": { "type": "array", "items": { "$ref": "#/$defs/link" } } } }, { "type": "array", "description": "Links only — node ids are derived from the endpoints.", "items": { "$ref": "#/$defs/link" } }] }, "chart-title": { "type": "string" }, "show-header": { "type": "boolean", "default": true }, "show-legend": { "type": "boolean", "default": true }, "show-tooltip": { "type": "boolean", "default": true } }, "required": ["data"], "$defs": { "node": { "type": "object", "required": ["id"], "properties": { "id": { "type": "string" }, "label": { "type": "string" }, "value": { "type": "number", "description": "Drives the size bucket." }, "type": { "type": "string", "description": "Category key → node colour." }, "color": { "type": "string" }, "img": { "type": "string", "description": "Avatar URL clipped to the node circle." } } }, "link": { "type": "object", "required": ["source", "target"], "properties": { "id": { "type": "string" }, "source": { "type": "string" }, "target": { "type": "string" }, "value": { "type": "number" }, "type": { "type": "string", "enum": ["primary", "neutral", "secondary"] } } } } };
+const networkGraphMeta = {
+  id,
+  tag,
+  title,
+  description,
+  chartTypeKeys,
+  source,
+  stack,
+  lazyImport,
+  entry,
+  usageConditions,
+  allowedActions,
+  propsSchema
+};
+export {
+  allowedActions,
+  chartTypeKeys,
+  networkGraphMeta as default,
+  description,
+  entry,
+  id,
+  lazyImport,
+  propsSchema,
+  source,
+  stack,
+  tag,
+  title,
+  usageConditions
+};
+//# sourceMappingURL=metadata.json.js.map

package/dist/components/network-graph/metadata.json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metadata.json.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/components/network-graph/render/draw.d.ts

@@ -0,0 +1,46 @@
+import { WidgetTheme } from '../../../types/index.js';
+import { NetworkGraphModel } from '../lib/index.js';
+export interface RenderNetworkGraphOptions {
+    model: NetworkGraphModel;
+    /** `null` shows every node; otherwise only these ids stay visible. */
+    visibleIds: Set<string> | null;
+    width: number;
+    height: number;
+    theme: WidgetTheme;
+    /** Selection carried across a redraw (legend filtering keeps it). */
+    activeNodeId?: string | null;
+    /** Fired when a node is clicked; `null` when the same node is clicked again. */
+    onSelect?: (id: string | null) => void;
+    /** Drag-to-pan plus ctrl/cmd + wheel zoom. */
+    enableZoom?: boolean;
+}
+/**
+ * Live handle on a mounted graph. The element keeps this so the legend filter
+ * and container resizes can update the plot in place instead of rebuilding it.
+ */
+export interface NetworkGraphController {
+    /** Legend filter — toggles node/link visibility, the layout is untouched. */
+    setVisibleIds(visibleIds: Set<string> | null): void;
+    /** Container resize — re-frames the settled layout, runs no new force ticks. */
+    resize(width: number, height: number): void;
+}
+/** Stop the simulation attached to `container`, keeping its layout for the next draw. */
+export declare function stopNetworkGraph(container: HTMLElement): void;
+/**
+ * Legend filter. Returns `false` when no graph is mounted so the caller can fall
+ * back to a full render; on success nothing is rebuilt and the camera holds.
+ */
+export declare function updateNetworkGraphVisibility(container: HTMLElement, visibleIds: Set<string> | null): boolean;
+/**
+ * Container resize. Returns `false` when no graph is mounted; otherwise the
+ * settled layout is re-framed without re-running the force simulation.
+ */
+export declare function resizeNetworkGraph(container: HTMLElement, width: number, height: number): boolean;
+/**
+ * FuseDash NetworkGraph — a d3-force layout of image/colour nodes joined by
+ * value-weighted links. The client lays out on a fixed 2000x1375 canvas and
+ * zooms into it; chat gives the chart its container instead, so the simulation
+ * runs in container coordinates with the spatial forces scaled to match.
+ */
+export declare function renderNetworkGraph(container: HTMLElement, options: RenderNetworkGraphOptions): NetworkGraphController | null;
+//# sourceMappingURL=draw.d.ts.map

package/dist/components/network-graph/render/draw.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"draw.d.ts","sourceRoot":"","sources":["../../../../src/components/network-graph/render/draw.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAgBL,KAAK,iBAAiB,EAGvB,MAAM,iBAAiB,CAAC;AAqCzB,MAAM,WAAW,yBAAyB;IACxC,KAAK,EAAE,iBAAiB,CAAC;IACzB,sEAAsE;IACtE,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,WAAW,CAAC;IACnB,qEAAqE;IACrE,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,gFAAgF;IAChF,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,KAAK,IAAI,CAAC;IACvC,8CAA8C;IAC9C,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AA8BD;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,6EAA6E;IAC7E,aAAa,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IACpD,gFAAgF;IAChF,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7C;AAgDD,yFAAyF;AACzF,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,WAAW,GAAG,IAAI,CAY7D;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAC1C,SAAS,EAAE,WAAW,EACtB,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,GAC7B,OAAO,CAKT;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,WAAW,EACtB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,GACb,OAAO,CAKT;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,yBAAyB,GACjC,sBAAsB,GAAG,IAAI,CAqT/B"}