@cocorof/graphier 0.1.0

package/README.md

@@ -0,0 +1,139 @@
+# Graphier
+
+High-performance 3D/2D graph renderer for React — powered by Three.js and d3-force-3d.
+
+![License](https://img.shields.io/badge/license-MIT-blue)
+
+## Features
+
+- **2 GPU draw calls** — InstancedMesh (nodes) + LineSegments (edges) for maximum performance
+- **Web Worker layout** — Force-directed simulation off the main thread (d3-force-3d)
+- **Custom GLSL shaders** — Fresnel rim glow + subsurface scatter on every node
+- **Post-processing** — UnrealBloomPass glow with adaptive resolution
+- **Auto-adaptive** — Layout, LOD, bloom, and fog scale automatically with graph size
+- **360 keyboard camera** — Full spherical rotation with quaternion-based controls, no gimbal lock
+- **Incremental updates** — `appendData()` adds nodes/links without full rebuild
+- **Position preservation** — Existing node positions survive data changes
+- **Theme system** — 3 built-in presets (celestial, neon, minimal) + fully customizable
+- **Node Detail Panel** — Modal with navigation history, connections list, and 3D subgraph
+- **2D Subgraph View** — Lightweight canvas-based neighborhood renderer
+- **Graph Analysis** — Tree-shakeable analytics module (`graphier/analysis`), zero Three.js dependency
+- **TypeScript** — Full type safety with exported types
+- **Dual ESM/CJS** — Works in all bundler configurations
+
+## Install
+
+```bash
+npm install graphier three react react-dom
+```
+
+**Peer dependencies:** `react >= 18`, `react-dom >= 18`, `three >= 0.150`
+
+## Quick Start
+
+```tsx
+import { NetworkGraph3D } from "graphier";
+
+const data = {
+  nodes: [
+    { id: "alice", type: "person", label: "Alice", val: 10 },
+    { id: "bob", type: "person", label: "Bob", val: 5 },
+    { id: "project-x", type: "repo", label: "Project X", val: 20 },
+  ],
+  links: [
+    { source: "alice", target: "project-x", type: "owns" },
+    { source: "bob", target: "project-x", type: "contributes" },
+    { source: "alice", target: "bob", type: "follows" },
+  ],
+};
+
+export default function App() {
+  return (
+    <div style={{ width: "100vw", height: "100vh" }}>
+      <NetworkGraph3D data={data} />
+    </div>
+  );
+}
+```
+
+## Ref API
+
+```tsx
+const graphRef = useRef<NetworkGraph3DRef>(null);
+
+graphRef.current?.focusNode("alice", 1200);
+graphRef.current?.zoomToFit(800, 100);
+graphRef.current?.zoomIn();
+graphRef.current?.zoomOut();
+graphRef.current?.appendData(newNodes, newLinks);
+graphRef.current?.screenshot();
+```
+
+## Theme & Style
+
+```tsx
+<NetworkGraph3D
+  data={data}
+  theme="celestial"              // or "neon", "minimal", or a ThemeConfig object
+  style={{
+    bloomStrength: 0.7,
+    fogDensity: 0.0004,
+    nodeMinSize: 2,
+    nodeMaxSize: 18,
+    showLabels: true,
+    maxLabels: 200,
+  }}
+/>
+```
+
+## Analysis Module
+
+```tsx
+import { analyzeGraph } from "graphier/analysis";
+
+const stats = analyzeGraph(data);
+// stats.nodeCount, stats.density, stats.avgDegree, stats.topByDegree(10), ...
+```
+
+## Keyboard Controls
+
+| Key | Action |
+|-----|--------|
+| `Z` / `X` | Zoom in / out |
+| Arrow keys | 360 camera rotation |
+| `Escape` | Deselect |
+
+## Documentation
+
+- [USAGE.md](./USAGE.md) — Full English documentation
+- [USAGE.ko.md](./USAGE.ko.md) — 한국어 문서
+
+## Next.js / SSR
+
+```tsx
+// app/page.tsx
+"use client";
+import dynamic from "next/dynamic";
+const GraphView = dynamic(() => import("./GraphView"), { ssr: false });
+```
+
+```js
+// next.config.js
+const nextConfig = { transpilePackages: ["graphier"] };
+```
+
+## Architecture
+
+```
+NetworkGraph3D
+├── InstancedMesh        (all nodes → 1 draw call)
+├── LineSegments          (all edges → 1 draw call)
+├── Web Worker            (d3-force-3d layout, off main thread)
+├── UnrealBloomPass       (post-processing glow)
+├── Sprite labels         (distance-culled, texture-cached)
+└── Keyboard controls     (quaternion-based 360 rotation)
+```
+
+## License
+
+MIT

package/dist/analysis.cjs

@@ -0,0 +1,126 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function computeDegreeMap(data) {
+  const degree = {};
+  for (const n of data.nodes) degree[n.id] = 0;
+  for (const l of data.links) {
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (degree[s] !== void 0) degree[s]++;
+    if (degree[t] !== void 0) degree[t]++;
+  }
+  return degree;
+}
+function computeDegreeStats(degreeMap) {
+  const values = Object.values(degreeMap);
+  if (values.length === 0) {
+    return { min: 0, max: 0, avg: 0, total: 0 };
+  }
+  const total = values.reduce((a, b) => a + b, 0);
+  return {
+    min: Math.min(...values),
+    max: Math.max(...values),
+    avg: total / values.length,
+    total
+  };
+}
+function topByDegree(nodes, degreeMap, n) {
+  return nodes.map((node) => ({ ...node, degree: degreeMap[node.id] ?? 0 })).sort((a, b) => b.degree - a.degree).slice(0, n);
+}
+function computeDensity(nodeCount, linkCount) {
+  if (nodeCount <= 1) return 0;
+  return 2 * linkCount / (nodeCount * (nodeCount - 1));
+}
+function computeLinkTypeBreakdown(links) {
+  const counts = {};
+  for (const l of links) {
+    const type = l.type ?? "default";
+    counts[type] = (counts[type] ?? 0) + 1;
+  }
+  return counts;
+}
+function computeNodeLinkCounts(data, linkTypes) {
+  const counts = /* @__PURE__ */ new Map();
+  for (const n of data.nodes) counts.set(n.id, 0);
+  const typeSet = new Set(linkTypes);
+  for (const l of data.links) {
+    if (!typeSet.has(l.type ?? "default")) continue;
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (counts.has(s)) counts.set(s, counts.get(s) + 1);
+    if (counts.has(t)) counts.set(t, counts.get(t) + 1);
+  }
+  return counts;
+}
+function findHubs(nodes, degreeMap, minDegree) {
+  return nodes.map((n) => ({ ...n, degree: degreeMap[n.id] ?? 0 })).filter((n) => n.degree >= minDegree).sort((a, b) => b.degree - a.degree);
+}
+function groupByType(nodes) {
+  const groups = {};
+  for (const n of nodes) {
+    const type = n.type ?? "default";
+    groups[type] = (groups[type] ?? 0) + 1;
+  }
+  return groups;
+}
+function buildAdjacencyMap(links) {
+  const adj = /* @__PURE__ */ new Map();
+  for (const l of links) {
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (!adj.has(s)) adj.set(s, []);
+    if (!adj.has(t)) adj.set(t, []);
+    adj.get(s).push(t);
+    adj.get(t).push(s);
+  }
+  return adj;
+}
+function getNeighbors(adjacencyMap, rootId, maxHops) {
+  const visited = /* @__PURE__ */ new Map();
+  visited.set(rootId, 0);
+  const queue = [rootId];
+  while (queue.length > 0) {
+    const current = queue.shift();
+    const dist = visited.get(current);
+    if (dist >= maxHops) continue;
+    for (const nb of adjacencyMap.get(current) ?? []) {
+      if (!visited.has(nb)) {
+        visited.set(nb, dist + 1);
+        queue.push(nb);
+      }
+    }
+  }
+  return visited;
+}
+function analyzeGraph(data) {
+  const degreeMap = computeDegreeMap(data);
+  const degreeStats = computeDegreeStats(degreeMap);
+  const density = computeDensity(data.nodes.length, data.links.length);
+  const nodesByType = groupByType(data.nodes);
+  const linksByType = computeLinkTypeBreakdown(data.links);
+  return {
+    nodeCount: data.nodes.length,
+    linkCount: data.links.length,
+    density,
+    avgDegree: degreeStats.avg,
+    maxDegree: degreeStats.max,
+    minDegree: degreeStats.min,
+    totalDegree: degreeStats.total,
+    degreeMap,
+    nodesByType,
+    linksByType,
+    topByDegree: (n) => topByDegree(data.nodes, degreeMap, n)
+  };
+}
+exports.analyzeGraph = analyzeGraph;
+exports.buildAdjacencyMap = buildAdjacencyMap;
+exports.computeDegreeMap = computeDegreeMap;
+exports.computeDegreeStats = computeDegreeStats;
+exports.computeDensity = computeDensity;
+exports.computeLinkTypeBreakdown = computeLinkTypeBreakdown;
+exports.computeNodeLinkCounts = computeNodeLinkCounts;
+exports.findHubs = findHubs;
+exports.getNeighbors = getNeighbors;
+exports.groupByType = groupByType;
+exports.topByDegree = topByDegree;
+//# sourceMappingURL=analysis.cjs.map

package/dist/analysis.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.cjs","sources":["../src/analysis/degree.ts","../src/analysis/density.ts","../src/analysis/centrality.ts","../src/analysis/adjacency.ts","../src/analysis/index.ts"],"sourcesContent":["/**\n * Degree computation: degree map, distribution stats.\n */\nimport type { GraphData, GraphNode } from \"../types\";\n\nexport interface DegreeMap {\n  [nodeId: string]: number;\n}\n\n/** Compute degree for every node */\nexport function computeDegreeMap(data: GraphData): DegreeMap {\n  const degree: DegreeMap = {};\n  for (const n of data.nodes) degree[n.id] = 0;\n  for (const l of data.links) {\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (degree[s] !== undefined) degree[s]++;\n    if (degree[t] !== undefined) degree[t]++;\n  }\n  return degree;\n}\n\nexport interface DegreeStats {\n  min: number;\n  max: number;\n  avg: number;\n  total: number;\n}\n\n/** Compute degree distribution statistics */\nexport function computeDegreeStats(degreeMap: DegreeMap): DegreeStats {\n  const values = Object.values(degreeMap);\n  if (values.length === 0) {\n    return { min: 0, max: 0, avg: 0, total: 0 };\n  }\n  const total = values.reduce((a, b) => a + b, 0);\n  return {\n    min: Math.min(...values),\n    max: Math.max(...values),\n    avg: total / values.length,\n    total,\n  };\n}\n\n/** Get top N nodes by degree */\nexport function topByDegree(\n  nodes: GraphNode[],\n  degreeMap: DegreeMap,\n  n: number\n): Array<GraphNode & { degree: number }> {\n  return nodes\n    .map((node) => ({ ...node, degree: degreeMap[node.id] ?? 0 }))\n    .sort((a, b) => b.degree - a.degree)\n    .slice(0, n);\n}\n","/**\n * Network density computation.\n */\n\n/** Compute graph density: 2|E| / (|N| * (|N| - 1)) for undirected graphs */\nexport function computeDensity(nodeCount: number, linkCount: number): number {\n  if (nodeCount <= 1) return 0;\n  return (2 * linkCount) / (nodeCount * (nodeCount - 1));\n}\n","/**\n * Centrality and hub detection.\n */\nimport type { GraphData, GraphNode, GraphLink } from \"../types\";\nimport { computeDegreeMap, type DegreeMap } from \"./degree\";\n\nexport interface LinkTypeBreakdown {\n  [linkType: string]: number;\n}\n\n/** Count links by type */\nexport function computeLinkTypeBreakdown(links: GraphLink[]): LinkTypeBreakdown {\n  const counts: LinkTypeBreakdown = {};\n  for (const l of links) {\n    const type = l.type ?? \"default\";\n    counts[type] = (counts[type] ?? 0) + 1;\n  }\n  return counts;\n}\n\n/** Count how many links of specific types each node has */\nexport function computeNodeLinkCounts(\n  data: GraphData,\n  linkTypes: string[]\n): Map<string, number> {\n  const counts = new Map<string, number>();\n  for (const n of data.nodes) counts.set(n.id, 0);\n\n  const typeSet = new Set(linkTypes);\n  for (const l of data.links) {\n    if (!typeSet.has(l.type ?? \"default\")) continue;\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (counts.has(s)) counts.set(s, counts.get(s)! + 1);\n    if (counts.has(t)) counts.set(t, counts.get(t)! + 1);\n  }\n  return counts;\n}\n\n/**\n * Find hub nodes — nodes with degree above a threshold.\n * Returns nodes sorted by degree descending.\n */\nexport function findHubs(\n  nodes: GraphNode[],\n  degreeMap: DegreeMap,\n  minDegree: number\n): Array<GraphNode & { degree: number }> {\n  return nodes\n    .map((n) => ({ ...n, degree: degreeMap[n.id] ?? 0 }))\n    .filter((n) => n.degree >= minDegree)\n    .sort((a, b) => b.degree - a.degree);\n}\n\n/** Group nodes by type with counts */\nexport function groupByType(\n  nodes: GraphNode[]\n): Record<string, number> {\n  const groups: Record<string, number> = {};\n  for (const n of nodes) {\n    const type = n.type ?? \"default\";\n    groups[type] = (groups[type] ?? 0) + 1;\n  }\n  return groups;\n}\n","/**\n * Adjacency list construction and N-hop neighbor search.\n */\nimport type { GraphLink } from \"../types\";\n\n/** Build an adjacency map from a list of links */\nexport function buildAdjacencyMap(\n  links: GraphLink[]\n): Map<string, string[]> {\n  const adj = new Map<string, string[]>();\n  for (const l of links) {\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (!adj.has(s)) adj.set(s, []);\n    if (!adj.has(t)) adj.set(t, []);\n    adj.get(s)!.push(t);\n    adj.get(t)!.push(s);\n  }\n  return adj;\n}\n\n/**\n * Find all nodes within N hops of a root node.\n * Returns a Map of node ID → hop distance.\n */\nexport function getNeighbors(\n  adjacencyMap: Map<string, string[]>,\n  rootId: string,\n  maxHops: number\n): Map<string, number> {\n  const visited = new Map<string, number>();\n  visited.set(rootId, 0);\n  const queue = [rootId];\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    const dist = visited.get(current)!;\n    if (dist >= maxHops) continue;\n    for (const nb of adjacencyMap.get(current) ?? []) {\n      if (!visited.has(nb)) {\n        visited.set(nb, dist + 1);\n        queue.push(nb);\n      }\n    }\n  }\n  return visited;\n}\n","/**\n * Graph analysis module — tree-shakeable, no Three.js dependency.\n *\n * Usage:\n *   import { analyzeGraph, buildAdjacencyMap } from 'graphier/analysis';\n */\nimport type { GraphData, GraphNode } from \"../types\";\nimport { computeDegreeMap, computeDegreeStats, topByDegree } from \"./degree\";\nimport { computeDensity } from \"./density\";\nimport {\n  computeLinkTypeBreakdown,\n  groupByType,\n} from \"./centrality\";\nimport { buildAdjacencyMap, getNeighbors } from \"./adjacency\";\n\nexport interface GraphAnalytics {\n  nodeCount: number;\n  linkCount: number;\n  density: number;\n  avgDegree: number;\n  maxDegree: number;\n  minDegree: number;\n  totalDegree: number;\n  degreeMap: Record<string, number>;\n  nodesByType: Record<string, number>;\n  linksByType: Record<string, number>;\n  /** Get top N nodes by degree */\n  topByDegree(n: number): Array<GraphNode & { degree: number }>;\n}\n\n/**\n * Analyze a graph and return comprehensive statistics.\n *\n * @example\n * ```ts\n * const stats = analyzeGraph(data);\n * console.log(`Density: ${stats.density}`);\n * console.log(`Top hubs:`, stats.topByDegree(10));\n * ```\n */\nexport function analyzeGraph(data: GraphData): GraphAnalytics {\n  const degreeMap = computeDegreeMap(data);\n  const degreeStats = computeDegreeStats(degreeMap);\n  const density = computeDensity(data.nodes.length, data.links.length);\n  const nodesByType = groupByType(data.nodes);\n  const linksByType = computeLinkTypeBreakdown(data.links);\n\n  return {\n    nodeCount: data.nodes.length,\n    linkCount: data.links.length,\n    density,\n    avgDegree: degreeStats.avg,\n    maxDegree: degreeStats.max,\n    minDegree: degreeStats.min,\n    totalDegree: degreeStats.total,\n    degreeMap,\n    nodesByType,\n    linksByType,\n    topByDegree: (n: number) => topByDegree(data.nodes, degreeMap, n),\n  };\n}\n\n// Re-export individual utilities\nexport { buildAdjacencyMap, getNeighbors } from \"./adjacency\";\nexport { computeDegreeMap, computeDegreeStats, topByDegree } from \"./degree\";\nexport { computeDensity } from \"./density\";\nexport {\n  computeLinkTypeBreakdown,\n  computeNodeLinkCounts,\n  findHubs,\n  groupByType,\n} from \"./centrality\";\n"],"names":[],"mappings":";;AAUO,SAAS,iBAAiB,MAA4B;AAC3D,QAAM,SAAoB,CAAA;AAC1B,aAAW,KAAK,KAAK,MAAO,QAAO,EAAE,EAAE,IAAI;AAC3C,aAAW,KAAK,KAAK,OAAO;AAC1B,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,OAAO,CAAC,MAAM,eAAkB,CAAC;AACrC,QAAI,OAAO,CAAC,MAAM,eAAkB,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAUO,SAAS,mBAAmB,WAAmC;AACpE,QAAM,SAAS,OAAO,OAAO,SAAS;AACtC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,OAAO,EAAA;AAAA,EAC1C;AACA,QAAM,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9C,SAAO;AAAA,IACL,KAAK,KAAK,IAAI,GAAG,MAAM;AAAA,IACvB,KAAK,KAAK,IAAI,GAAG,MAAM;AAAA,IACvB,KAAK,QAAQ,OAAO;AAAA,IACpB;AAAA,EAAA;AAEJ;AAGO,SAAS,YACd,OACA,WACA,GACuC;AACvC,SAAO,MACJ,IAAI,CAAC,UAAU,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,EAAE,KAAK,EAAA,EAAI,EAC5D,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAClC,MAAM,GAAG,CAAC;AACf;ACjDO,SAAS,eAAe,WAAmB,WAA2B;AAC3E,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAQ,IAAI,aAAc,aAAa,YAAY;AACrD;ACGO,SAAS,yBAAyB,OAAuC;AAC9E,QAAM,SAA4B,CAAA;AAClC,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO,EAAE,QAAQ;AACvB,WAAO,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EACvC;AACA,SAAO;AACT;AAGO,SAAS,sBACd,MACA,WACqB;AACrB,QAAM,6BAAa,IAAA;AACnB,aAAW,KAAK,KAAK,cAAc,IAAI,EAAE,IAAI,CAAC;AAE9C,QAAM,UAAU,IAAI,IAAI,SAAS;AACjC,aAAW,KAAK,KAAK,OAAO;AAC1B,QAAI,CAAC,QAAQ,IAAI,EAAE,QAAQ,SAAS,EAAG;AACvC,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,OAAO,IAAI,CAAC,EAAG,QAAO,IAAI,GAAG,OAAO,IAAI,CAAC,IAAK,CAAC;AACnD,QAAI,OAAO,IAAI,CAAC,EAAG,QAAO,IAAI,GAAG,OAAO,IAAI,CAAC,IAAK,CAAC;AAAA,EACrD;AACA,SAAO;AACT;AAMO,SAAS,SACd,OACA,WACA,WACuC;AACvC,SAAO,MACJ,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,UAAU,EAAE,EAAE,KAAK,EAAA,EAAI,EACnD,OAAO,CAAC,MAAM,EAAE,UAAU,SAAS,EACnC,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACvC;AAGO,SAAS,YACd,OACwB;AACxB,QAAM,SAAiC,CAAA;AACvC,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO,EAAE,QAAQ;AACvB,WAAO,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EACvC;AACA,SAAO;AACT;AC1DO,SAAS,kBACd,OACuB;AACvB,QAAM,0BAAU,IAAA;AAChB,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,CAAC,IAAI,IAAI,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE;AAC9B,QAAI,CAAC,IAAI,IAAI,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE;AAC9B,QAAI,IAAI,CAAC,EAAG,KAAK,CAAC;AAClB,QAAI,IAAI,CAAC,EAAG,KAAK,CAAC;AAAA,EACpB;AACA,SAAO;AACT;AAMO,SAAS,aACd,cACA,QACA,SACqB;AACrB,QAAM,8BAAc,IAAA;AACpB,UAAQ,IAAI,QAAQ,CAAC;AACrB,QAAM,QAAQ,CAAC,MAAM;AACrB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,MAAA;AACtB,UAAM,OAAO,QAAQ,IAAI,OAAO;AAChC,QAAI,QAAQ,QAAS;AACrB,eAAW,MAAM,aAAa,IAAI,OAAO,KAAK,CAAA,GAAI;AAChD,UAAI,CAAC,QAAQ,IAAI,EAAE,GAAG;AACpB,gBAAQ,IAAI,IAAI,OAAO,CAAC;AACxB,cAAM,KAAK,EAAE;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;ACLO,SAAS,aAAa,MAAiC;AAC5D,QAAM,YAAY,iBAAiB,IAAI;AACvC,QAAM,cAAc,mBAAmB,SAAS;AAChD,QAAM,UAAU,eAAe,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM;AACnE,QAAM,cAAc,YAAY,KAAK,KAAK;AAC1C,QAAM,cAAc,yBAAyB,KAAK,KAAK;AAEvD,SAAO;AAAA,IACL,WAAW,KAAK,MAAM;AAAA,IACtB,WAAW,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,WAAW,YAAY;AAAA,IACvB,WAAW,YAAY;AAAA,IACvB,WAAW,YAAY;AAAA,IACvB,aAAa,YAAY;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,CAAC,MAAc,YAAY,KAAK,OAAO,WAAW,CAAC;AAAA,EAAA;AAEpE;;;;;;;;;;;;"}

package/dist/analysis.d.ts

@@ -0,0 +1,126 @@
+/**
+ * Analyze a graph and return comprehensive statistics.
+ *
+ * @example
+ * ```ts
+ * const stats = analyzeGraph(data);
+ * console.log(`Density: ${stats.density}`);
+ * console.log(`Top hubs:`, stats.topByDegree(10));
+ * ```
+ */
+export declare function analyzeGraph(data: GraphData): GraphAnalytics;
+
+/** Build an adjacency map from a list of links */
+export declare function buildAdjacencyMap(links: GraphLink[]): Map<string, string[]>;
+
+/** Compute degree for every node */
+export declare function computeDegreeMap(data: GraphData): DegreeMap;
+
+/** Compute degree distribution statistics */
+export declare function computeDegreeStats(degreeMap: DegreeMap): DegreeStats;
+
+/**
+ * Network density computation.
+ */
+/** Compute graph density: 2|E| / (|N| * (|N| - 1)) for undirected graphs */
+export declare function computeDensity(nodeCount: number, linkCount: number): number;
+
+/** Count links by type */
+export declare function computeLinkTypeBreakdown(links: GraphLink[]): LinkTypeBreakdown;
+
+/** Count how many links of specific types each node has */
+export declare function computeNodeLinkCounts(data: GraphData, linkTypes: string[]): Map<string, number>;
+
+declare interface DegreeMap {
+    [nodeId: string]: number;
+}
+
+declare interface DegreeStats {
+    min: number;
+    max: number;
+    avg: number;
+    total: number;
+}
+
+/**
+ * Find hub nodes — nodes with degree above a threshold.
+ * Returns nodes sorted by degree descending.
+ */
+export declare function findHubs(nodes: GraphNode[], degreeMap: DegreeMap, minDegree: number): Array<GraphNode & {
+    degree: number;
+}>;
+
+/**
+ * Find all nodes within N hops of a root node.
+ * Returns a Map of node ID → hop distance.
+ */
+export declare function getNeighbors(adjacencyMap: Map<string, string[]>, rootId: string, maxHops: number): Map<string, number>;
+
+export declare interface GraphAnalytics {
+    nodeCount: number;
+    linkCount: number;
+    density: number;
+    avgDegree: number;
+    maxDegree: number;
+    minDegree: number;
+    totalDegree: number;
+    degreeMap: Record<string, number>;
+    nodesByType: Record<string, number>;
+    linksByType: Record<string, number>;
+    /** Get top N nodes by degree */
+    topByDegree(n: number): Array<GraphNode & {
+        degree: number;
+    }>;
+}
+
+declare interface GraphData {
+    nodes: GraphNode[];
+    links: GraphLink[];
+}
+
+declare interface GraphLink {
+    /** Source node id */
+    source: string;
+    /** Target node id */
+    target: string;
+    /** Relationship type — maps to theme colors (e.g. "follows", "owns") */
+    type?: string;
+    /** Edge weight (default: 1) */
+    weight?: number;
+    /** User-defined extra data */
+    [key: string]: unknown;
+}
+
+/**
+ * Core graph data types — domain-agnostic.
+ * Users provide any `type` string ("person", "server", "repo", etc.)
+ * and the theme system maps them to colors automatically.
+ */
+declare interface GraphNode {
+    /** Unique identifier */
+    id: string;
+    /** Node category — maps to theme colors (e.g. "person", "repo") */
+    type?: string;
+    /** Display label (falls back to id) */
+    label?: string;
+    /** Size weight — higher values render larger (default: 1) */
+    val?: number;
+    /** Grouping key for color auto-assignment (alternative to type) */
+    group?: string;
+    /** User-defined extra data (accessible in callbacks) */
+    [key: string]: unknown;
+}
+
+/** Group nodes by type with counts */
+export declare function groupByType(nodes: GraphNode[]): Record<string, number>;
+
+declare interface LinkTypeBreakdown {
+    [linkType: string]: number;
+}
+
+/** Get top N nodes by degree */
+export declare function topByDegree(nodes: GraphNode[], degreeMap: DegreeMap, n: number): Array<GraphNode & {
+    degree: number;
+}>;
+
+export { }

package/dist/analysis.js

@@ -0,0 +1,126 @@
+function computeDegreeMap(data) {
+  const degree = {};
+  for (const n of data.nodes) degree[n.id] = 0;
+  for (const l of data.links) {
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (degree[s] !== void 0) degree[s]++;
+    if (degree[t] !== void 0) degree[t]++;
+  }
+  return degree;
+}
+function computeDegreeStats(degreeMap) {
+  const values = Object.values(degreeMap);
+  if (values.length === 0) {
+    return { min: 0, max: 0, avg: 0, total: 0 };
+  }
+  const total = values.reduce((a, b) => a + b, 0);
+  return {
+    min: Math.min(...values),
+    max: Math.max(...values),
+    avg: total / values.length,
+    total
+  };
+}
+function topByDegree(nodes, degreeMap, n) {
+  return nodes.map((node) => ({ ...node, degree: degreeMap[node.id] ?? 0 })).sort((a, b) => b.degree - a.degree).slice(0, n);
+}
+function computeDensity(nodeCount, linkCount) {
+  if (nodeCount <= 1) return 0;
+  return 2 * linkCount / (nodeCount * (nodeCount - 1));
+}
+function computeLinkTypeBreakdown(links) {
+  const counts = {};
+  for (const l of links) {
+    const type = l.type ?? "default";
+    counts[type] = (counts[type] ?? 0) + 1;
+  }
+  return counts;
+}
+function computeNodeLinkCounts(data, linkTypes) {
+  const counts = /* @__PURE__ */ new Map();
+  for (const n of data.nodes) counts.set(n.id, 0);
+  const typeSet = new Set(linkTypes);
+  for (const l of data.links) {
+    if (!typeSet.has(l.type ?? "default")) continue;
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (counts.has(s)) counts.set(s, counts.get(s) + 1);
+    if (counts.has(t)) counts.set(t, counts.get(t) + 1);
+  }
+  return counts;
+}
+function findHubs(nodes, degreeMap, minDegree) {
+  return nodes.map((n) => ({ ...n, degree: degreeMap[n.id] ?? 0 })).filter((n) => n.degree >= minDegree).sort((a, b) => b.degree - a.degree);
+}
+function groupByType(nodes) {
+  const groups = {};
+  for (const n of nodes) {
+    const type = n.type ?? "default";
+    groups[type] = (groups[type] ?? 0) + 1;
+  }
+  return groups;
+}
+function buildAdjacencyMap(links) {
+  const adj = /* @__PURE__ */ new Map();
+  for (const l of links) {
+    const s = typeof l.source === "object" ? l.source.id : l.source;
+    const t = typeof l.target === "object" ? l.target.id : l.target;
+    if (!adj.has(s)) adj.set(s, []);
+    if (!adj.has(t)) adj.set(t, []);
+    adj.get(s).push(t);
+    adj.get(t).push(s);
+  }
+  return adj;
+}
+function getNeighbors(adjacencyMap, rootId, maxHops) {
+  const visited = /* @__PURE__ */ new Map();
+  visited.set(rootId, 0);
+  const queue = [rootId];
+  while (queue.length > 0) {
+    const current = queue.shift();
+    const dist = visited.get(current);
+    if (dist >= maxHops) continue;
+    for (const nb of adjacencyMap.get(current) ?? []) {
+      if (!visited.has(nb)) {
+        visited.set(nb, dist + 1);
+        queue.push(nb);
+      }
+    }
+  }
+  return visited;
+}
+function analyzeGraph(data) {
+  const degreeMap = computeDegreeMap(data);
+  const degreeStats = computeDegreeStats(degreeMap);
+  const density = computeDensity(data.nodes.length, data.links.length);
+  const nodesByType = groupByType(data.nodes);
+  const linksByType = computeLinkTypeBreakdown(data.links);
+  return {
+    nodeCount: data.nodes.length,
+    linkCount: data.links.length,
+    density,
+    avgDegree: degreeStats.avg,
+    maxDegree: degreeStats.max,
+    minDegree: degreeStats.min,
+    totalDegree: degreeStats.total,
+    degreeMap,
+    nodesByType,
+    linksByType,
+    topByDegree: (n) => topByDegree(data.nodes, degreeMap, n)
+  };
+}
+export {
+  analyzeGraph,
+  buildAdjacencyMap,
+  computeDegreeMap,
+  computeDegreeStats,
+  computeDensity,
+  computeLinkTypeBreakdown,
+  computeNodeLinkCounts,
+  findHubs,
+  getNeighbors,
+  groupByType,
+  topByDegree
+};
+//# sourceMappingURL=analysis.js.map

package/dist/analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.js","sources":["../src/analysis/degree.ts","../src/analysis/density.ts","../src/analysis/centrality.ts","../src/analysis/adjacency.ts","../src/analysis/index.ts"],"sourcesContent":["/**\n * Degree computation: degree map, distribution stats.\n */\nimport type { GraphData, GraphNode } from \"../types\";\n\nexport interface DegreeMap {\n  [nodeId: string]: number;\n}\n\n/** Compute degree for every node */\nexport function computeDegreeMap(data: GraphData): DegreeMap {\n  const degree: DegreeMap = {};\n  for (const n of data.nodes) degree[n.id] = 0;\n  for (const l of data.links) {\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (degree[s] !== undefined) degree[s]++;\n    if (degree[t] !== undefined) degree[t]++;\n  }\n  return degree;\n}\n\nexport interface DegreeStats {\n  min: number;\n  max: number;\n  avg: number;\n  total: number;\n}\n\n/** Compute degree distribution statistics */\nexport function computeDegreeStats(degreeMap: DegreeMap): DegreeStats {\n  const values = Object.values(degreeMap);\n  if (values.length === 0) {\n    return { min: 0, max: 0, avg: 0, total: 0 };\n  }\n  const total = values.reduce((a, b) => a + b, 0);\n  return {\n    min: Math.min(...values),\n    max: Math.max(...values),\n    avg: total / values.length,\n    total,\n  };\n}\n\n/** Get top N nodes by degree */\nexport function topByDegree(\n  nodes: GraphNode[],\n  degreeMap: DegreeMap,\n  n: number\n): Array<GraphNode & { degree: number }> {\n  return nodes\n    .map((node) => ({ ...node, degree: degreeMap[node.id] ?? 0 }))\n    .sort((a, b) => b.degree - a.degree)\n    .slice(0, n);\n}\n","/**\n * Network density computation.\n */\n\n/** Compute graph density: 2|E| / (|N| * (|N| - 1)) for undirected graphs */\nexport function computeDensity(nodeCount: number, linkCount: number): number {\n  if (nodeCount <= 1) return 0;\n  return (2 * linkCount) / (nodeCount * (nodeCount - 1));\n}\n","/**\n * Centrality and hub detection.\n */\nimport type { GraphData, GraphNode, GraphLink } from \"../types\";\nimport { computeDegreeMap, type DegreeMap } from \"./degree\";\n\nexport interface LinkTypeBreakdown {\n  [linkType: string]: number;\n}\n\n/** Count links by type */\nexport function computeLinkTypeBreakdown(links: GraphLink[]): LinkTypeBreakdown {\n  const counts: LinkTypeBreakdown = {};\n  for (const l of links) {\n    const type = l.type ?? \"default\";\n    counts[type] = (counts[type] ?? 0) + 1;\n  }\n  return counts;\n}\n\n/** Count how many links of specific types each node has */\nexport function computeNodeLinkCounts(\n  data: GraphData,\n  linkTypes: string[]\n): Map<string, number> {\n  const counts = new Map<string, number>();\n  for (const n of data.nodes) counts.set(n.id, 0);\n\n  const typeSet = new Set(linkTypes);\n  for (const l of data.links) {\n    if (!typeSet.has(l.type ?? \"default\")) continue;\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (counts.has(s)) counts.set(s, counts.get(s)! + 1);\n    if (counts.has(t)) counts.set(t, counts.get(t)! + 1);\n  }\n  return counts;\n}\n\n/**\n * Find hub nodes — nodes with degree above a threshold.\n * Returns nodes sorted by degree descending.\n */\nexport function findHubs(\n  nodes: GraphNode[],\n  degreeMap: DegreeMap,\n  minDegree: number\n): Array<GraphNode & { degree: number }> {\n  return nodes\n    .map((n) => ({ ...n, degree: degreeMap[n.id] ?? 0 }))\n    .filter((n) => n.degree >= minDegree)\n    .sort((a, b) => b.degree - a.degree);\n}\n\n/** Group nodes by type with counts */\nexport function groupByType(\n  nodes: GraphNode[]\n): Record<string, number> {\n  const groups: Record<string, number> = {};\n  for (const n of nodes) {\n    const type = n.type ?? \"default\";\n    groups[type] = (groups[type] ?? 0) + 1;\n  }\n  return groups;\n}\n","/**\n * Adjacency list construction and N-hop neighbor search.\n */\nimport type { GraphLink } from \"../types\";\n\n/** Build an adjacency map from a list of links */\nexport function buildAdjacencyMap(\n  links: GraphLink[]\n): Map<string, string[]> {\n  const adj = new Map<string, string[]>();\n  for (const l of links) {\n    const s = typeof l.source === \"object\" ? (l.source as any).id : l.source;\n    const t = typeof l.target === \"object\" ? (l.target as any).id : l.target;\n    if (!adj.has(s)) adj.set(s, []);\n    if (!adj.has(t)) adj.set(t, []);\n    adj.get(s)!.push(t);\n    adj.get(t)!.push(s);\n  }\n  return adj;\n}\n\n/**\n * Find all nodes within N hops of a root node.\n * Returns a Map of node ID → hop distance.\n */\nexport function getNeighbors(\n  adjacencyMap: Map<string, string[]>,\n  rootId: string,\n  maxHops: number\n): Map<string, number> {\n  const visited = new Map<string, number>();\n  visited.set(rootId, 0);\n  const queue = [rootId];\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n    const dist = visited.get(current)!;\n    if (dist >= maxHops) continue;\n    for (const nb of adjacencyMap.get(current) ?? []) {\n      if (!visited.has(nb)) {\n        visited.set(nb, dist + 1);\n        queue.push(nb);\n      }\n    }\n  }\n  return visited;\n}\n","/**\n * Graph analysis module — tree-shakeable, no Three.js dependency.\n *\n * Usage:\n *   import { analyzeGraph, buildAdjacencyMap } from 'graphier/analysis';\n */\nimport type { GraphData, GraphNode } from \"../types\";\nimport { computeDegreeMap, computeDegreeStats, topByDegree } from \"./degree\";\nimport { computeDensity } from \"./density\";\nimport {\n  computeLinkTypeBreakdown,\n  groupByType,\n} from \"./centrality\";\nimport { buildAdjacencyMap, getNeighbors } from \"./adjacency\";\n\nexport interface GraphAnalytics {\n  nodeCount: number;\n  linkCount: number;\n  density: number;\n  avgDegree: number;\n  maxDegree: number;\n  minDegree: number;\n  totalDegree: number;\n  degreeMap: Record<string, number>;\n  nodesByType: Record<string, number>;\n  linksByType: Record<string, number>;\n  /** Get top N nodes by degree */\n  topByDegree(n: number): Array<GraphNode & { degree: number }>;\n}\n\n/**\n * Analyze a graph and return comprehensive statistics.\n *\n * @example\n * ```ts\n * const stats = analyzeGraph(data);\n * console.log(`Density: ${stats.density}`);\n * console.log(`Top hubs:`, stats.topByDegree(10));\n * ```\n */\nexport function analyzeGraph(data: GraphData): GraphAnalytics {\n  const degreeMap = computeDegreeMap(data);\n  const degreeStats = computeDegreeStats(degreeMap);\n  const density = computeDensity(data.nodes.length, data.links.length);\n  const nodesByType = groupByType(data.nodes);\n  const linksByType = computeLinkTypeBreakdown(data.links);\n\n  return {\n    nodeCount: data.nodes.length,\n    linkCount: data.links.length,\n    density,\n    avgDegree: degreeStats.avg,\n    maxDegree: degreeStats.max,\n    minDegree: degreeStats.min,\n    totalDegree: degreeStats.total,\n    degreeMap,\n    nodesByType,\n    linksByType,\n    topByDegree: (n: number) => topByDegree(data.nodes, degreeMap, n),\n  };\n}\n\n// Re-export individual utilities\nexport { buildAdjacencyMap, getNeighbors } from \"./adjacency\";\nexport { computeDegreeMap, computeDegreeStats, topByDegree } from \"./degree\";\nexport { computeDensity } from \"./density\";\nexport {\n  computeLinkTypeBreakdown,\n  computeNodeLinkCounts,\n  findHubs,\n  groupByType,\n} from \"./centrality\";\n"],"names":[],"mappings":"AAUO,SAAS,iBAAiB,MAA4B;AAC3D,QAAM,SAAoB,CAAA;AAC1B,aAAW,KAAK,KAAK,MAAO,QAAO,EAAE,EAAE,IAAI;AAC3C,aAAW,KAAK,KAAK,OAAO;AAC1B,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,OAAO,CAAC,MAAM,eAAkB,CAAC;AACrC,QAAI,OAAO,CAAC,MAAM,eAAkB,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAUO,SAAS,mBAAmB,WAAmC;AACpE,QAAM,SAAS,OAAO,OAAO,SAAS;AACtC,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,OAAO,EAAA;AAAA,EAC1C;AACA,QAAM,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9C,SAAO;AAAA,IACL,KAAK,KAAK,IAAI,GAAG,MAAM;AAAA,IACvB,KAAK,KAAK,IAAI,GAAG,MAAM;AAAA,IACvB,KAAK,QAAQ,OAAO;AAAA,IACpB;AAAA,EAAA;AAEJ;AAGO,SAAS,YACd,OACA,WACA,GACuC;AACvC,SAAO,MACJ,IAAI,CAAC,UAAU,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,EAAE,KAAK,EAAA,EAAI,EAC5D,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAClC,MAAM,GAAG,CAAC;AACf;ACjDO,SAAS,eAAe,WAAmB,WAA2B;AAC3E,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAQ,IAAI,aAAc,aAAa,YAAY;AACrD;ACGO,SAAS,yBAAyB,OAAuC;AAC9E,QAAM,SAA4B,CAAA;AAClC,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO,EAAE,QAAQ;AACvB,WAAO,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EACvC;AACA,SAAO;AACT;AAGO,SAAS,sBACd,MACA,WACqB;AACrB,QAAM,6BAAa,IAAA;AACnB,aAAW,KAAK,KAAK,cAAc,IAAI,EAAE,IAAI,CAAC;AAE9C,QAAM,UAAU,IAAI,IAAI,SAAS;AACjC,aAAW,KAAK,KAAK,OAAO;AAC1B,QAAI,CAAC,QAAQ,IAAI,EAAE,QAAQ,SAAS,EAAG;AACvC,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,OAAO,IAAI,CAAC,EAAG,QAAO,IAAI,GAAG,OAAO,IAAI,CAAC,IAAK,CAAC;AACnD,QAAI,OAAO,IAAI,CAAC,EAAG,QAAO,IAAI,GAAG,OAAO,IAAI,CAAC,IAAK,CAAC;AAAA,EACrD;AACA,SAAO;AACT;AAMO,SAAS,SACd,OACA,WACA,WACuC;AACvC,SAAO,MACJ,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,QAAQ,UAAU,EAAE,EAAE,KAAK,EAAA,EAAI,EACnD,OAAO,CAAC,MAAM,EAAE,UAAU,SAAS,EACnC,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACvC;AAGO,SAAS,YACd,OACwB;AACxB,QAAM,SAAiC,CAAA;AACvC,aAAW,KAAK,OAAO;AACrB,UAAM,OAAO,EAAE,QAAQ;AACvB,WAAO,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EACvC;AACA,SAAO;AACT;AC1DO,SAAS,kBACd,OACuB;AACvB,QAAM,0BAAU,IAAA;AAChB,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,UAAM,IAAI,OAAO,EAAE,WAAW,WAAY,EAAE,OAAe,KAAK,EAAE;AAClE,QAAI,CAAC,IAAI,IAAI,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE;AAC9B,QAAI,CAAC,IAAI,IAAI,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE;AAC9B,QAAI,IAAI,CAAC,EAAG,KAAK,CAAC;AAClB,QAAI,IAAI,CAAC,EAAG,KAAK,CAAC;AAAA,EACpB;AACA,SAAO;AACT;AAMO,SAAS,aACd,cACA,QACA,SACqB;AACrB,QAAM,8BAAc,IAAA;AACpB,UAAQ,IAAI,QAAQ,CAAC;AACrB,QAAM,QAAQ,CAAC,MAAM;AACrB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,MAAA;AACtB,UAAM,OAAO,QAAQ,IAAI,OAAO;AAChC,QAAI,QAAQ,QAAS;AACrB,eAAW,MAAM,aAAa,IAAI,OAAO,KAAK,CAAA,GAAI;AAChD,UAAI,CAAC,QAAQ,IAAI,EAAE,GAAG;AACpB,gBAAQ,IAAI,IAAI,OAAO,CAAC;AACxB,cAAM,KAAK,EAAE;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;ACLO,SAAS,aAAa,MAAiC;AAC5D,QAAM,YAAY,iBAAiB,IAAI;AACvC,QAAM,cAAc,mBAAmB,SAAS;AAChD,QAAM,UAAU,eAAe,KAAK,MAAM,QAAQ,KAAK,MAAM,MAAM;AACnE,QAAM,cAAc,YAAY,KAAK,KAAK;AAC1C,QAAM,cAAc,yBAAyB,KAAK,KAAK;AAEvD,SAAO;AAAA,IACL,WAAW,KAAK,MAAM;AAAA,IACtB,WAAW,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,WAAW,YAAY;AAAA,IACvB,WAAW,YAAY;AAAA,IACvB,WAAW,YAAY;AAAA,IACvB,aAAa,YAAY;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,CAAC,MAAc,YAAY,KAAK,OAAO,WAAW,CAAC;AAAA,EAAA;AAEpE;"}