@fragments-sdk/mcp 0.5.0 → 0.5.2

package/dist/chunk-WXUZ55XQ.js

@@ -0,0 +1,386 @@
+// ../context/dist/graph/index.js
+var GRAPH_EDGE_TYPES = [
+  "imports",
+  "hook-depends",
+  "renders",
+  "composes",
+  "parent-of",
+  "alternative-to",
+  "sibling-of"
+];
+var EDGE_TYPE_WEIGHTS = {
+  "imports": 1,
+  "hook-depends": 0.75,
+  "renders": 0.5,
+  "composes": 0.5,
+  "parent-of": 1,
+  "alternative-to": 1,
+  "sibling-of": 0.75
+};
+var ComponentGraphEngine = class {
+  nodes;
+  outgoing;
+  incoming;
+  edges;
+  blockIndex;
+  health;
+  constructor(graph, blocks) {
+    this.nodes = /* @__PURE__ */ new Map();
+    this.outgoing = /* @__PURE__ */ new Map();
+    this.incoming = /* @__PURE__ */ new Map();
+    this.edges = graph.edges;
+    this.health = graph.health;
+    this.blockIndex = /* @__PURE__ */ new Map();
+    for (const node of graph.nodes) {
+      this.nodes.set(node.name, node);
+      this.outgoing.set(node.name, []);
+      this.incoming.set(node.name, []);
+    }
+    for (const edge of graph.edges) {
+      const out = this.outgoing.get(edge.source);
+      if (out) out.push(edge);
+      else this.outgoing.set(edge.source, [edge]);
+      const inc = this.incoming.get(edge.target);
+      if (inc) inc.push(edge);
+      else this.incoming.set(edge.target, [edge]);
+    }
+    if (blocks) {
+      for (const [blockName, block] of Object.entries(blocks)) {
+        for (const comp of block.components) {
+          const existing = this.blockIndex.get(comp);
+          if (existing) existing.push(blockName);
+          else this.blockIndex.set(comp, [blockName]);
+        }
+      }
+    }
+  }
+  // -------------------------------------------------------------------------
+  // Core queries
+  // -------------------------------------------------------------------------
+  /** Get outgoing edges from a component, optionally filtered by edge type */
+  dependencies(component, edgeTypes) {
+    const edges = this.outgoing.get(component) ?? [];
+    if (!edgeTypes || edgeTypes.length === 0) return edges;
+    return edges.filter((e) => edgeTypes.includes(e.type));
+  }
+  /** Get incoming edges to a component, optionally filtered by edge type */
+  dependents(component, edgeTypes) {
+    const edges = this.incoming.get(component) ?? [];
+    if (!edgeTypes || edgeTypes.length === 0) return edges;
+    return edges.filter((e) => edgeTypes.includes(e.type));
+  }
+  /** BFS transitive closure — what's affected if this component changes */
+  impact(component, maxDepth = 3) {
+    const affected = [];
+    const visited = /* @__PURE__ */ new Set([component]);
+    const queue = [
+      { name: component, depth: 0, path: [component] }
+    ];
+    while (queue.length > 0) {
+      const current = queue.shift();
+      if (current.depth >= maxDepth) continue;
+      const deps = this.incoming.get(current.name) ?? [];
+      for (const edge of deps) {
+        if (visited.has(edge.source)) continue;
+        visited.add(edge.source);
+        const newPath = [...current.path, edge.source];
+        affected.push({
+          component: edge.source,
+          depth: current.depth + 1,
+          path: newPath,
+          edgeType: edge.type
+        });
+        queue.push({ name: edge.source, depth: current.depth + 1, path: newPath });
+      }
+    }
+    const affectedComponents = /* @__PURE__ */ new Set([component, ...affected.map((a) => a.component)]);
+    const affectedBlocks = /* @__PURE__ */ new Set();
+    for (const comp of affectedComponents) {
+      const blocks = this.blockIndex.get(comp);
+      if (blocks) {
+        for (const b of blocks) affectedBlocks.add(b);
+      }
+    }
+    return {
+      component,
+      affected,
+      affectedBlocks: [...affectedBlocks],
+      totalAffected: affected.length
+    };
+  }
+  /** BFS shortest path between two components (undirected) */
+  path(from, to) {
+    if (from === to) {
+      return { found: true, path: [from], edges: [] };
+    }
+    const visited = /* @__PURE__ */ new Set([from]);
+    const queue = [
+      { name: from, path: [from], edges: [] }
+    ];
+    while (queue.length > 0) {
+      const current = queue.shift();
+      const allEdges = [
+        ...this.outgoing.get(current.name) ?? [],
+        ...this.incoming.get(current.name) ?? []
+      ];
+      for (const edge of allEdges) {
+        const neighbor = edge.source === current.name ? edge.target : edge.source;
+        if (visited.has(neighbor)) continue;
+        visited.add(neighbor);
+        const newPath = [...current.path, neighbor];
+        const newEdges = [...current.edges, edge];
+        if (neighbor === to) {
+          return { found: true, path: newPath, edges: newEdges };
+        }
+        queue.push({ name: neighbor, path: newPath, edges: newEdges });
+      }
+    }
+    return { found: false, path: [], edges: [] };
+  }
+  /** Connected components via BFS on undirected projection */
+  islands() {
+    const visited = /* @__PURE__ */ new Set();
+    const components = [];
+    for (const nodeName of this.nodes.keys()) {
+      if (visited.has(nodeName)) continue;
+      const island = [];
+      const queue = [nodeName];
+      visited.add(nodeName);
+      while (queue.length > 0) {
+        const current = queue.shift();
+        island.push(current);
+        const allEdges = [
+          ...this.outgoing.get(current) ?? [],
+          ...this.incoming.get(current) ?? []
+        ];
+        for (const edge of allEdges) {
+          const neighbor = edge.source === current ? edge.target : edge.source;
+          if (!visited.has(neighbor) && this.nodes.has(neighbor)) {
+            visited.add(neighbor);
+            queue.push(neighbor);
+          }
+        }
+      }
+      components.push(island.sort());
+    }
+    return components.sort((a, b) => b.length - a.length);
+  }
+  /** All components reachable within N hops (undirected) */
+  neighbors(component, maxHops = 1) {
+    const neighbors = [];
+    const visited = /* @__PURE__ */ new Set([component]);
+    const queue = [
+      { name: component, hops: 0 }
+    ];
+    while (queue.length > 0) {
+      const current = queue.shift();
+      if (current.hops >= maxHops) continue;
+      const allEdges = [
+        ...this.outgoing.get(current.name) ?? [],
+        ...this.incoming.get(current.name) ?? []
+      ];
+      for (const edge of allEdges) {
+        const neighbor = edge.source === current.name ? edge.target : edge.source;
+        if (visited.has(neighbor)) continue;
+        visited.add(neighbor);
+        neighbors.push({
+          component: neighbor,
+          hops: current.hops + 1,
+          edgeType: edge.type
+        });
+        queue.push({ name: neighbor, hops: current.hops + 1 });
+      }
+    }
+    return { component, neighbors };
+  }
+  // -------------------------------------------------------------------------
+  // Design-system queries
+  // -------------------------------------------------------------------------
+  /** Get the composition tree for a compound component */
+  composition(component) {
+    const node = this.nodes.get(component);
+    const subComponents = node?.subComponents ?? [];
+    const parentEdges = (this.outgoing.get(component) ?? []).filter((e) => e.type === "parent-of");
+    const requiredChildren = parentEdges.map((e) => e.target);
+    const childEdges = (this.incoming.get(component) ?? []).filter((e) => e.type === "parent-of");
+    const parent = childEdges.length > 0 ? childEdges[0].source : void 0;
+    const siblings = [];
+    if (parent) {
+      const parentOut = (this.outgoing.get(parent) ?? []).filter((e) => e.type === "parent-of");
+      for (const edge of parentOut) {
+        if (edge.target !== component) {
+          siblings.push(edge.target);
+        }
+      }
+    }
+    const siblingEdges = [
+      ...(this.outgoing.get(component) ?? []).filter((e) => e.type === "sibling-of"),
+      ...(this.incoming.get(component) ?? []).filter((e) => e.type === "sibling-of")
+    ];
+    for (const edge of siblingEdges) {
+      const sib = edge.source === component ? edge.target : edge.source;
+      if (!siblings.includes(sib)) siblings.push(sib);
+    }
+    return {
+      component,
+      compositionPattern: node?.compositionPattern,
+      subComponents,
+      requiredChildren,
+      parent,
+      siblings,
+      blocks: this.blockIndex.get(component) ?? []
+    };
+  }
+  /** Get alternative components */
+  alternatives(component) {
+    const alts = [];
+    for (const edge of this.outgoing.get(component) ?? []) {
+      if (edge.type === "alternative-to") {
+        alts.push({ component: edge.target, note: edge.note });
+      }
+    }
+    for (const edge of this.incoming.get(component) ?? []) {
+      if (edge.type === "alternative-to") {
+        alts.push({ component: edge.source, note: edge.note });
+      }
+    }
+    return alts;
+  }
+  /** Get blocks that use a component */
+  blocksUsing(component) {
+    return this.blockIndex.get(component) ?? [];
+  }
+  /** Extract an induced subgraph for a set of components */
+  subgraph(components) {
+    const componentSet = new Set(components);
+    const nodes = components.map((name) => this.nodes.get(name)).filter((n) => n !== void 0);
+    const edges = this.edges.filter(
+      (e) => componentSet.has(e.source) && componentSet.has(e.target)
+    );
+    return {
+      nodes,
+      edges,
+      health: computeHealthFromData(nodes, edges, this.blockIndex)
+    };
+  }
+  /** Return precomputed health metrics */
+  getHealth() {
+    return this.health;
+  }
+  /** Get a single node by name */
+  getNode(name) {
+    return this.nodes.get(name);
+  }
+  /** Check if a component exists in the graph */
+  hasNode(name) {
+    return this.nodes.has(name);
+  }
+};
+function computeHealthFromData(nodes, edges, blockIndex) {
+  const nodeNames = new Set(nodes.map((n) => n.name));
+  const degreeMap = /* @__PURE__ */ new Map();
+  for (const name of nodeNames) {
+    degreeMap.set(name, 0);
+  }
+  for (const edge of edges) {
+    degreeMap.set(edge.source, (degreeMap.get(edge.source) ?? 0) + 1);
+    degreeMap.set(edge.target, (degreeMap.get(edge.target) ?? 0) + 1);
+  }
+  const orphans = [];
+  for (const [name, degree] of degreeMap) {
+    if (degree === 0) orphans.push(name);
+  }
+  const hubs = [...degreeMap.entries()].map(([name, degree]) => ({ name, degree })).sort((a, b) => b.degree - a.degree).slice(0, 10);
+  let inBlock = 0;
+  if (blockIndex) {
+    for (const name of nodeNames) {
+      if ((blockIndex.get(name) ?? []).length > 0) inBlock++;
+    }
+  }
+  const compositionCoverage = nodeNames.size > 0 ? Math.round(inBlock / nodeNames.size * 100) : 0;
+  const adjacency = /* @__PURE__ */ new Map();
+  for (const name of nodeNames) {
+    adjacency.set(name, /* @__PURE__ */ new Set());
+  }
+  for (const edge of edges) {
+    adjacency.get(edge.source)?.add(edge.target);
+    adjacency.get(edge.target)?.add(edge.source);
+  }
+  const visited = /* @__PURE__ */ new Set();
+  const connectedComponents = [];
+  for (const name of nodeNames) {
+    if (visited.has(name)) continue;
+    const island = [];
+    const queue = [name];
+    visited.add(name);
+    while (queue.length > 0) {
+      const current = queue.shift();
+      island.push(current);
+      for (const neighbor of adjacency.get(current) ?? []) {
+        if (!visited.has(neighbor)) {
+          visited.add(neighbor);
+          queue.push(neighbor);
+        }
+      }
+    }
+    connectedComponents.push(island.sort());
+  }
+  connectedComponents.sort((a, b) => b.length - a.length);
+  const totalDegree = [...degreeMap.values()].reduce((sum, d) => sum + d, 0);
+  const averageDegree = nodeNames.size > 0 ? Math.round(totalDegree / nodeNames.size * 100) / 100 : 0;
+  return {
+    orphans: orphans.sort(),
+    hubs,
+    compositionCoverage,
+    connectedComponents,
+    averageDegree,
+    nodeCount: nodeNames.size,
+    edgeCount: edges.length
+  };
+}
+function serializeGraph(graph) {
+  return {
+    nodes: graph.nodes,
+    edges: graph.edges.map(serializeEdge),
+    health: graph.health
+  };
+}
+function deserializeGraph(serialized) {
+  return {
+    nodes: serialized.nodes,
+    edges: serialized.edges.map(deserializeEdge),
+    health: serialized.health
+  };
+}
+function serializeEdge(edge) {
+  const result = {
+    s: edge.source,
+    t: edge.target,
+    ty: edge.type,
+    w: edge.weight,
+    p: edge.provenance
+  };
+  if (edge.note) result.no = edge.note;
+  return result;
+}
+function deserializeEdge(edge) {
+  const result = {
+    source: edge.s,
+    target: edge.t,
+    type: edge.ty,
+    weight: edge.w,
+    provenance: edge.p
+  };
+  if (edge.no) result.note = edge.no;
+  return result;
+}
+
+export {
+  GRAPH_EDGE_TYPES,
+  EDGE_TYPE_WEIGHTS,
+  ComponentGraphEngine,
+  computeHealthFromData,
+  serializeGraph,
+  deserializeGraph
+};
+//# sourceMappingURL=chunk-WXUZ55XQ.js.map

package/dist/chunk-WXUZ55XQ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../context/dist/graph/index.js"],"sourcesContent":["// src/graph/types.ts\nvar GRAPH_EDGE_TYPES = [\n  \"imports\",\n  \"hook-depends\",\n  \"renders\",\n  \"composes\",\n  \"parent-of\",\n  \"alternative-to\",\n  \"sibling-of\"\n];\nvar EDGE_TYPE_WEIGHTS = {\n  \"imports\": 1,\n  \"hook-depends\": 0.75,\n  \"renders\": 0.5,\n  \"composes\": 0.5,\n  \"parent-of\": 1,\n  \"alternative-to\": 1,\n  \"sibling-of\": 0.75\n};\n\n// src/graph/engine.ts\nvar ComponentGraphEngine = class {\n  nodes;\n  outgoing;\n  incoming;\n  edges;\n  blockIndex;\n  health;\n  constructor(graph, blocks) {\n    this.nodes = /* @__PURE__ */ new Map();\n    this.outgoing = /* @__PURE__ */ new Map();\n    this.incoming = /* @__PURE__ */ new Map();\n    this.edges = graph.edges;\n    this.health = graph.health;\n    this.blockIndex = /* @__PURE__ */ new Map();\n    for (const node of graph.nodes) {\n      this.nodes.set(node.name, node);\n      this.outgoing.set(node.name, []);\n      this.incoming.set(node.name, []);\n    }\n    for (const edge of graph.edges) {\n      const out = this.outgoing.get(edge.source);\n      if (out) out.push(edge);\n      else this.outgoing.set(edge.source, [edge]);\n      const inc = this.incoming.get(edge.target);\n      if (inc) inc.push(edge);\n      else this.incoming.set(edge.target, [edge]);\n    }\n    if (blocks) {\n      for (const [blockName, block] of Object.entries(blocks)) {\n        for (const comp of block.components) {\n          const existing = this.blockIndex.get(comp);\n          if (existing) existing.push(blockName);\n          else this.blockIndex.set(comp, [blockName]);\n        }\n      }\n    }\n  }\n  // -------------------------------------------------------------------------\n  // Core queries\n  // -------------------------------------------------------------------------\n  /** Get outgoing edges from a component, optionally filtered by edge type */\n  dependencies(component, edgeTypes) {\n    const edges = this.outgoing.get(component) ?? [];\n    if (!edgeTypes || edgeTypes.length === 0) return edges;\n    return edges.filter((e) => edgeTypes.includes(e.type));\n  }\n  /** Get incoming edges to a component, optionally filtered by edge type */\n  dependents(component, edgeTypes) {\n    const edges = this.incoming.get(component) ?? [];\n    if (!edgeTypes || edgeTypes.length === 0) return edges;\n    return edges.filter((e) => edgeTypes.includes(e.type));\n  }\n  /** BFS transitive closure — what's affected if this component changes */\n  impact(component, maxDepth = 3) {\n    const affected = [];\n    const visited = /* @__PURE__ */ new Set([component]);\n    const queue = [\n      { name: component, depth: 0, path: [component] }\n    ];\n    while (queue.length > 0) {\n      const current = queue.shift();\n      if (current.depth >= maxDepth) continue;\n      const deps = this.incoming.get(current.name) ?? [];\n      for (const edge of deps) {\n        if (visited.has(edge.source)) continue;\n        visited.add(edge.source);\n        const newPath = [...current.path, edge.source];\n        affected.push({\n          component: edge.source,\n          depth: current.depth + 1,\n          path: newPath,\n          edgeType: edge.type\n        });\n        queue.push({ name: edge.source, depth: current.depth + 1, path: newPath });\n      }\n    }\n    const affectedComponents = /* @__PURE__ */ new Set([component, ...affected.map((a) => a.component)]);\n    const affectedBlocks = /* @__PURE__ */ new Set();\n    for (const comp of affectedComponents) {\n      const blocks = this.blockIndex.get(comp);\n      if (blocks) {\n        for (const b of blocks) affectedBlocks.add(b);\n      }\n    }\n    return {\n      component,\n      affected,\n      affectedBlocks: [...affectedBlocks],\n      totalAffected: affected.length\n    };\n  }\n  /** BFS shortest path between two components (undirected) */\n  path(from, to) {\n    if (from === to) {\n      return { found: true, path: [from], edges: [] };\n    }\n    const visited = /* @__PURE__ */ new Set([from]);\n    const queue = [\n      { name: from, path: [from], edges: [] }\n    ];\n    while (queue.length > 0) {\n      const current = queue.shift();\n      const allEdges = [\n        ...this.outgoing.get(current.name) ?? [],\n        ...this.incoming.get(current.name) ?? []\n      ];\n      for (const edge of allEdges) {\n        const neighbor = edge.source === current.name ? edge.target : edge.source;\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        const newPath = [...current.path, neighbor];\n        const newEdges = [...current.edges, edge];\n        if (neighbor === to) {\n          return { found: true, path: newPath, edges: newEdges };\n        }\n        queue.push({ name: neighbor, path: newPath, edges: newEdges });\n      }\n    }\n    return { found: false, path: [], edges: [] };\n  }\n  /** Connected components via BFS on undirected projection */\n  islands() {\n    const visited = /* @__PURE__ */ new Set();\n    const components = [];\n    for (const nodeName of this.nodes.keys()) {\n      if (visited.has(nodeName)) continue;\n      const island = [];\n      const queue = [nodeName];\n      visited.add(nodeName);\n      while (queue.length > 0) {\n        const current = queue.shift();\n        island.push(current);\n        const allEdges = [\n          ...this.outgoing.get(current) ?? [],\n          ...this.incoming.get(current) ?? []\n        ];\n        for (const edge of allEdges) {\n          const neighbor = edge.source === current ? edge.target : edge.source;\n          if (!visited.has(neighbor) && this.nodes.has(neighbor)) {\n            visited.add(neighbor);\n            queue.push(neighbor);\n          }\n        }\n      }\n      components.push(island.sort());\n    }\n    return components.sort((a, b) => b.length - a.length);\n  }\n  /** All components reachable within N hops (undirected) */\n  neighbors(component, maxHops = 1) {\n    const neighbors = [];\n    const visited = /* @__PURE__ */ new Set([component]);\n    const queue = [\n      { name: component, hops: 0 }\n    ];\n    while (queue.length > 0) {\n      const current = queue.shift();\n      if (current.hops >= maxHops) continue;\n      const allEdges = [\n        ...this.outgoing.get(current.name) ?? [],\n        ...this.incoming.get(current.name) ?? []\n      ];\n      for (const edge of allEdges) {\n        const neighbor = edge.source === current.name ? edge.target : edge.source;\n        if (visited.has(neighbor)) continue;\n        visited.add(neighbor);\n        neighbors.push({\n          component: neighbor,\n          hops: current.hops + 1,\n          edgeType: edge.type\n        });\n        queue.push({ name: neighbor, hops: current.hops + 1 });\n      }\n    }\n    return { component, neighbors };\n  }\n  // -------------------------------------------------------------------------\n  // Design-system queries\n  // -------------------------------------------------------------------------\n  /** Get the composition tree for a compound component */\n  composition(component) {\n    const node = this.nodes.get(component);\n    const subComponents = node?.subComponents ?? [];\n    const parentEdges = (this.outgoing.get(component) ?? []).filter((e) => e.type === \"parent-of\");\n    const requiredChildren = parentEdges.map((e) => e.target);\n    const childEdges = (this.incoming.get(component) ?? []).filter((e) => e.type === \"parent-of\");\n    const parent = childEdges.length > 0 ? childEdges[0].source : void 0;\n    const siblings = [];\n    if (parent) {\n      const parentOut = (this.outgoing.get(parent) ?? []).filter((e) => e.type === \"parent-of\");\n      for (const edge of parentOut) {\n        if (edge.target !== component) {\n          siblings.push(edge.target);\n        }\n      }\n    }\n    const siblingEdges = [\n      ...(this.outgoing.get(component) ?? []).filter((e) => e.type === \"sibling-of\"),\n      ...(this.incoming.get(component) ?? []).filter((e) => e.type === \"sibling-of\")\n    ];\n    for (const edge of siblingEdges) {\n      const sib = edge.source === component ? edge.target : edge.source;\n      if (!siblings.includes(sib)) siblings.push(sib);\n    }\n    return {\n      component,\n      compositionPattern: node?.compositionPattern,\n      subComponents,\n      requiredChildren,\n      parent,\n      siblings,\n      blocks: this.blockIndex.get(component) ?? []\n    };\n  }\n  /** Get alternative components */\n  alternatives(component) {\n    const alts = [];\n    for (const edge of this.outgoing.get(component) ?? []) {\n      if (edge.type === \"alternative-to\") {\n        alts.push({ component: edge.target, note: edge.note });\n      }\n    }\n    for (const edge of this.incoming.get(component) ?? []) {\n      if (edge.type === \"alternative-to\") {\n        alts.push({ component: edge.source, note: edge.note });\n      }\n    }\n    return alts;\n  }\n  /** Get blocks that use a component */\n  blocksUsing(component) {\n    return this.blockIndex.get(component) ?? [];\n  }\n  /** Extract an induced subgraph for a set of components */\n  subgraph(components) {\n    const componentSet = new Set(components);\n    const nodes = components.map((name) => this.nodes.get(name)).filter((n) => n !== void 0);\n    const edges = this.edges.filter(\n      (e) => componentSet.has(e.source) && componentSet.has(e.target)\n    );\n    return {\n      nodes,\n      edges,\n      health: computeHealthFromData(nodes, edges, this.blockIndex)\n    };\n  }\n  /** Return precomputed health metrics */\n  getHealth() {\n    return this.health;\n  }\n  /** Get a single node by name */\n  getNode(name) {\n    return this.nodes.get(name);\n  }\n  /** Check if a component exists in the graph */\n  hasNode(name) {\n    return this.nodes.has(name);\n  }\n};\nfunction computeHealthFromData(nodes, edges, blockIndex) {\n  const nodeNames = new Set(nodes.map((n) => n.name));\n  const degreeMap = /* @__PURE__ */ new Map();\n  for (const name of nodeNames) {\n    degreeMap.set(name, 0);\n  }\n  for (const edge of edges) {\n    degreeMap.set(edge.source, (degreeMap.get(edge.source) ?? 0) + 1);\n    degreeMap.set(edge.target, (degreeMap.get(edge.target) ?? 0) + 1);\n  }\n  const orphans = [];\n  for (const [name, degree] of degreeMap) {\n    if (degree === 0) orphans.push(name);\n  }\n  const hubs = [...degreeMap.entries()].map(([name, degree]) => ({ name, degree })).sort((a, b) => b.degree - a.degree).slice(0, 10);\n  let inBlock = 0;\n  if (blockIndex) {\n    for (const name of nodeNames) {\n      if ((blockIndex.get(name) ?? []).length > 0) inBlock++;\n    }\n  }\n  const compositionCoverage = nodeNames.size > 0 ? Math.round(inBlock / nodeNames.size * 100) : 0;\n  const adjacency = /* @__PURE__ */ new Map();\n  for (const name of nodeNames) {\n    adjacency.set(name, /* @__PURE__ */ new Set());\n  }\n  for (const edge of edges) {\n    adjacency.get(edge.source)?.add(edge.target);\n    adjacency.get(edge.target)?.add(edge.source);\n  }\n  const visited = /* @__PURE__ */ new Set();\n  const connectedComponents = [];\n  for (const name of nodeNames) {\n    if (visited.has(name)) continue;\n    const island = [];\n    const queue = [name];\n    visited.add(name);\n    while (queue.length > 0) {\n      const current = queue.shift();\n      island.push(current);\n      for (const neighbor of adjacency.get(current) ?? []) {\n        if (!visited.has(neighbor)) {\n          visited.add(neighbor);\n          queue.push(neighbor);\n        }\n      }\n    }\n    connectedComponents.push(island.sort());\n  }\n  connectedComponents.sort((a, b) => b.length - a.length);\n  const totalDegree = [...degreeMap.values()].reduce((sum, d) => sum + d, 0);\n  const averageDegree = nodeNames.size > 0 ? Math.round(totalDegree / nodeNames.size * 100) / 100 : 0;\n  return {\n    orphans: orphans.sort(),\n    hubs,\n    compositionCoverage,\n    connectedComponents,\n    averageDegree,\n    nodeCount: nodeNames.size,\n    edgeCount: edges.length\n  };\n}\n\n// src/graph/serialization.ts\nfunction serializeGraph(graph) {\n  return {\n    nodes: graph.nodes,\n    edges: graph.edges.map(serializeEdge),\n    health: graph.health\n  };\n}\nfunction deserializeGraph(serialized) {\n  return {\n    nodes: serialized.nodes,\n    edges: serialized.edges.map(deserializeEdge),\n    health: serialized.health\n  };\n}\nfunction serializeEdge(edge) {\n  const result = {\n    s: edge.source,\n    t: edge.target,\n    ty: edge.type,\n    w: edge.weight,\n    p: edge.provenance\n  };\n  if (edge.note) result.no = edge.note;\n  return result;\n}\nfunction deserializeEdge(edge) {\n  const result = {\n    source: edge.s,\n    target: edge.t,\n    type: edge.ty,\n    weight: edge.w,\n    provenance: edge.p\n  };\n  if (edge.no) result.note = edge.no;\n  return result;\n}\nexport {\n  ComponentGraphEngine,\n  EDGE_TYPE_WEIGHTS,\n  GRAPH_EDGE_TYPES,\n  computeHealthFromData,\n  deserializeGraph,\n  serializeGraph\n};\n"],"mappings":";AACA,IAAI,mBAAmB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAI,oBAAoB;AAAA,EACtB,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,cAAc;AAChB;AAGA,IAAI,uBAAuB,MAAM;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,OAAO,QAAQ;AACzB,SAAK,QAAwB,oBAAI,IAAI;AACrC,SAAK,WAA2B,oBAAI,IAAI;AACxC,SAAK,WAA2B,oBAAI,IAAI;AACxC,SAAK,QAAQ,MAAM;AACnB,SAAK,SAAS,MAAM;AACpB,SAAK,aAA6B,oBAAI,IAAI;AAC1C,eAAW,QAAQ,MAAM,OAAO;AAC9B,WAAK,MAAM,IAAI,KAAK,MAAM,IAAI;AAC9B,WAAK,SAAS,IAAI,KAAK,MAAM,CAAC,CAAC;AAC/B,WAAK,SAAS,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,IACjC;AACA,eAAW,QAAQ,MAAM,OAAO;AAC9B,YAAM,MAAM,KAAK,SAAS,IAAI,KAAK,MAAM;AACzC,UAAI,IAAK,KAAI,KAAK,IAAI;AAAA,UACjB,MAAK,SAAS,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC;AAC1C,YAAM,MAAM,KAAK,SAAS,IAAI,KAAK,MAAM;AACzC,UAAI,IAAK,KAAI,KAAK,IAAI;AAAA,UACjB,MAAK,SAAS,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC;AAAA,IAC5C;AACA,QAAI,QAAQ;AACV,iBAAW,CAAC,WAAW,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACvD,mBAAW,QAAQ,MAAM,YAAY;AACnC,gBAAM,WAAW,KAAK,WAAW,IAAI,IAAI;AACzC,cAAI,SAAU,UAAS,KAAK,SAAS;AAAA,cAChC,MAAK,WAAW,IAAI,MAAM,CAAC,SAAS,CAAC;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,WAAW,WAAW;AACjC,UAAM,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC;AAC/C,QAAI,CAAC,aAAa,UAAU,WAAW,EAAG,QAAO;AACjD,WAAO,MAAM,OAAO,CAAC,MAAM,UAAU,SAAS,EAAE,IAAI,CAAC;AAAA,EACvD;AAAA;AAAA,EAEA,WAAW,WAAW,WAAW;AAC/B,UAAM,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC;AAC/C,QAAI,CAAC,aAAa,UAAU,WAAW,EAAG,QAAO;AACjD,WAAO,MAAM,OAAO,CAAC,MAAM,UAAU,SAAS,EAAE,IAAI,CAAC;AAAA,EACvD;AAAA;AAAA,EAEA,OAAO,WAAW,WAAW,GAAG;AAC9B,UAAM,WAAW,CAAC;AAClB,UAAM,UAA0B,oBAAI,IAAI,CAAC,SAAS,CAAC;AACnD,UAAM,QAAQ;AAAA,MACZ,EAAE,MAAM,WAAW,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE;AAAA,IACjD;AACA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAC5B,UAAI,QAAQ,SAAS,SAAU;AAC/B,YAAM,OAAO,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC;AACjD,iBAAW,QAAQ,MAAM;AACvB,YAAI,QAAQ,IAAI,KAAK,MAAM,EAAG;AAC9B,gBAAQ,IAAI,KAAK,MAAM;AACvB,cAAM,UAAU,CAAC,GAAG,QAAQ,MAAM,KAAK,MAAM;AAC7C,iBAAS,KAAK;AAAA,UACZ,WAAW,KAAK;AAAA,UAChB,OAAO,QAAQ,QAAQ;AAAA,UACvB,MAAM;AAAA,UACN,UAAU,KAAK;AAAA,QACjB,CAAC;AACD,cAAM,KAAK,EAAE,MAAM,KAAK,QAAQ,OAAO,QAAQ,QAAQ,GAAG,MAAM,QAAQ,CAAC;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,qBAAqC,oBAAI,IAAI,CAAC,WAAW,GAAG,SAAS,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AACnG,UAAM,iBAAiC,oBAAI,IAAI;AAC/C,eAAW,QAAQ,oBAAoB;AACrC,YAAM,SAAS,KAAK,WAAW,IAAI,IAAI;AACvC,UAAI,QAAQ;AACV,mBAAW,KAAK,OAAQ,gBAAe,IAAI,CAAC;AAAA,MAC9C;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,gBAAgB,CAAC,GAAG,cAAc;AAAA,MAClC,eAAe,SAAS;AAAA,IAC1B;AAAA,EACF;AAAA;AAAA,EAEA,KAAK,MAAM,IAAI;AACb,QAAI,SAAS,IAAI;AACf,aAAO,EAAE,OAAO,MAAM,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE;AAAA,IAChD;AACA,UAAM,UAA0B,oBAAI,IAAI,CAAC,IAAI,CAAC;AAC9C,UAAM,QAAQ;AAAA,MACZ,EAAE,MAAM,MAAM,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE;AAAA,IACxC;AACA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAC5B,YAAM,WAAW;AAAA,QACf,GAAG,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC;AAAA,QACvC,GAAG,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC;AAAA,MACzC;AACA,iBAAW,QAAQ,UAAU;AAC3B,cAAM,WAAW,KAAK,WAAW,QAAQ,OAAO,KAAK,SAAS,KAAK;AACnE,YAAI,QAAQ,IAAI,QAAQ,EAAG;AAC3B,gBAAQ,IAAI,QAAQ;AACpB,cAAM,UAAU,CAAC,GAAG,QAAQ,MAAM,QAAQ;AAC1C,cAAM,WAAW,CAAC,GAAG,QAAQ,OAAO,IAAI;AACxC,YAAI,aAAa,IAAI;AACnB,iBAAO,EAAE,OAAO,MAAM,MAAM,SAAS,OAAO,SAAS;AAAA,QACvD;AACA,cAAM,KAAK,EAAE,MAAM,UAAU,MAAM,SAAS,OAAO,SAAS,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,WAAO,EAAE,OAAO,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAC7C;AAAA;AAAA,EAEA,UAAU;AACR,UAAM,UAA0B,oBAAI,IAAI;AACxC,UAAM,aAAa,CAAC;AACpB,eAAW,YAAY,KAAK,MAAM,KAAK,GAAG;AACxC,UAAI,QAAQ,IAAI,QAAQ,EAAG;AAC3B,YAAM,SAAS,CAAC;AAChB,YAAM,QAAQ,CAAC,QAAQ;AACvB,cAAQ,IAAI,QAAQ;AACpB,aAAO,MAAM,SAAS,GAAG;AACvB,cAAM,UAAU,MAAM,MAAM;AAC5B,eAAO,KAAK,OAAO;AACnB,cAAM,WAAW;AAAA,UACf,GAAG,KAAK,SAAS,IAAI,OAAO,KAAK,CAAC;AAAA,UAClC,GAAG,KAAK,SAAS,IAAI,OAAO,KAAK,CAAC;AAAA,QACpC;AACA,mBAAW,QAAQ,UAAU;AAC3B,gBAAM,WAAW,KAAK,WAAW,UAAU,KAAK,SAAS,KAAK;AAC9D,cAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,QAAQ,GAAG;AACtD,oBAAQ,IAAI,QAAQ;AACpB,kBAAM,KAAK,QAAQ;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AACA,iBAAW,KAAK,OAAO,KAAK,CAAC;AAAA,IAC/B;AACA,WAAO,WAAW,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAAA,EACtD;AAAA;AAAA,EAEA,UAAU,WAAW,UAAU,GAAG;AAChC,UAAM,YAAY,CAAC;AACnB,UAAM,UAA0B,oBAAI,IAAI,CAAC,SAAS,CAAC;AACnD,UAAM,QAAQ;AAAA,MACZ,EAAE,MAAM,WAAW,MAAM,EAAE;AAAA,IAC7B;AACA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAC5B,UAAI,QAAQ,QAAQ,QAAS;AAC7B,YAAM,WAAW;AAAA,QACf,GAAG,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC;AAAA,QACvC,GAAG,KAAK,SAAS,IAAI,QAAQ,IAAI,KAAK,CAAC;AAAA,MACzC;AACA,iBAAW,QAAQ,UAAU;AAC3B,cAAM,WAAW,KAAK,WAAW,QAAQ,OAAO,KAAK,SAAS,KAAK;AACnE,YAAI,QAAQ,IAAI,QAAQ,EAAG;AAC3B,gBAAQ,IAAI,QAAQ;AACpB,kBAAU,KAAK;AAAA,UACb,WAAW;AAAA,UACX,MAAM,QAAQ,OAAO;AAAA,UACrB,UAAU,KAAK;AAAA,QACjB,CAAC;AACD,cAAM,KAAK,EAAE,MAAM,UAAU,MAAM,QAAQ,OAAO,EAAE,CAAC;AAAA,MACvD;AAAA,IACF;AACA,WAAO,EAAE,WAAW,UAAU;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,WAAW;AACrB,UAAM,OAAO,KAAK,MAAM,IAAI,SAAS;AACrC,UAAM,gBAAgB,MAAM,iBAAiB,CAAC;AAC9C,UAAM,eAAe,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW;AAC7F,UAAM,mBAAmB,YAAY,IAAI,CAAC,MAAM,EAAE,MAAM;AACxD,UAAM,cAAc,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW;AAC5F,UAAM,SAAS,WAAW,SAAS,IAAI,WAAW,CAAC,EAAE,SAAS;AAC9D,UAAM,WAAW,CAAC;AAClB,QAAI,QAAQ;AACV,YAAM,aAAa,KAAK,SAAS,IAAI,MAAM,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW;AACxF,iBAAW,QAAQ,WAAW;AAC5B,YAAI,KAAK,WAAW,WAAW;AAC7B,mBAAS,KAAK,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AACA,UAAM,eAAe;AAAA,MACnB,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAAA,MAC7E,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AAAA,IAC/E;AACA,eAAW,QAAQ,cAAc;AAC/B,YAAM,MAAM,KAAK,WAAW,YAAY,KAAK,SAAS,KAAK;AAC3D,UAAI,CAAC,SAAS,SAAS,GAAG,EAAG,UAAS,KAAK,GAAG;AAAA,IAChD;AACA,WAAO;AAAA,MACL;AAAA,MACA,oBAAoB,MAAM;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,KAAK,WAAW,IAAI,SAAS,KAAK,CAAC;AAAA,IAC7C;AAAA,EACF;AAAA;AAAA,EAEA,aAAa,WAAW;AACtB,UAAM,OAAO,CAAC;AACd,eAAW,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG;AACrD,UAAI,KAAK,SAAS,kBAAkB;AAClC,aAAK,KAAK,EAAE,WAAW,KAAK,QAAQ,MAAM,KAAK,KAAK,CAAC;AAAA,MACvD;AAAA,IACF;AACA,eAAW,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG;AACrD,UAAI,KAAK,SAAS,kBAAkB;AAClC,aAAK,KAAK,EAAE,WAAW,KAAK,QAAQ,MAAM,KAAK,KAAK,CAAC;AAAA,MACvD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAEA,YAAY,WAAW;AACrB,WAAO,KAAK,WAAW,IAAI,SAAS,KAAK,CAAC;AAAA,EAC5C;AAAA;AAAA,EAEA,SAAS,YAAY;AACnB,UAAM,eAAe,IAAI,IAAI,UAAU;AACvC,UAAM,QAAQ,WAAW,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,OAAO,CAAC,MAAM,MAAM,MAAM;AACvF,UAAM,QAAQ,KAAK,MAAM;AAAA,MACvB,CAAC,MAAM,aAAa,IAAI,EAAE,MAAM,KAAK,aAAa,IAAI,EAAE,MAAM;AAAA,IAChE;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,QAAQ,sBAAsB,OAAO,OAAO,KAAK,UAAU;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA,EAEA,YAAY;AACV,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAEA,QAAQ,MAAM;AACZ,WAAO,KAAK,MAAM,IAAI,IAAI;AAAA,EAC5B;AAAA;AAAA,EAEA,QAAQ,MAAM;AACZ,WAAO,KAAK,MAAM,IAAI,IAAI;AAAA,EAC5B;AACF;AACA,SAAS,sBAAsB,OAAO,OAAO,YAAY;AACvD,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAClD,QAAM,YAA4B,oBAAI,IAAI;AAC1C,aAAW,QAAQ,WAAW;AAC5B,cAAU,IAAI,MAAM,CAAC;AAAA,EACvB;AACA,aAAW,QAAQ,OAAO;AACxB,cAAU,IAAI,KAAK,SAAS,UAAU,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC;AAChE,cAAU,IAAI,KAAK,SAAS,UAAU,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC;AAAA,EAClE;AACA,QAAM,UAAU,CAAC;AACjB,aAAW,CAAC,MAAM,MAAM,KAAK,WAAW;AACtC,QAAI,WAAW,EAAG,SAAQ,KAAK,IAAI;AAAA,EACrC;AACA,QAAM,OAAO,CAAC,GAAG,UAAU,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,MAAM,OAAO,EAAE,MAAM,OAAO,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,GAAG,EAAE;AACjI,MAAI,UAAU;AACd,MAAI,YAAY;AACd,eAAW,QAAQ,WAAW;AAC5B,WAAK,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG,SAAS,EAAG;AAAA,IAC/C;AAAA,EACF;AACA,QAAM,sBAAsB,UAAU,OAAO,IAAI,KAAK,MAAM,UAAU,UAAU,OAAO,GAAG,IAAI;AAC9F,QAAM,YAA4B,oBAAI,IAAI;AAC1C,aAAW,QAAQ,WAAW;AAC5B,cAAU,IAAI,MAAsB,oBAAI,IAAI,CAAC;AAAA,EAC/C;AACA,aAAW,QAAQ,OAAO;AACxB,cAAU,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,MAAM;AAC3C,cAAU,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,MAAM;AAAA,EAC7C;AACA,QAAM,UAA0B,oBAAI,IAAI;AACxC,QAAM,sBAAsB,CAAC;AAC7B,aAAW,QAAQ,WAAW;AAC5B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,UAAM,SAAS,CAAC;AAChB,UAAM,QAAQ,CAAC,IAAI;AACnB,YAAQ,IAAI,IAAI;AAChB,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAC5B,aAAO,KAAK,OAAO;AACnB,iBAAW,YAAY,UAAU,IAAI,OAAO,KAAK,CAAC,GAAG;AACnD,YAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,kBAAQ,IAAI,QAAQ;AACpB,gBAAM,KAAK,QAAQ;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AACA,wBAAoB,KAAK,OAAO,KAAK,CAAC;AAAA,EACxC;AACA,sBAAoB,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACtD,QAAM,cAAc,CAAC,GAAG,UAAU,OAAO,CAAC,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,GAAG,CAAC;AACzE,QAAM,gBAAgB,UAAU,OAAO,IAAI,KAAK,MAAM,cAAc,UAAU,OAAO,GAAG,IAAI,MAAM;AAClG,SAAO;AAAA,IACL,SAAS,QAAQ,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,UAAU;AAAA,IACrB,WAAW,MAAM;AAAA,EACnB;AACF;AAGA,SAAS,eAAe,OAAO;AAC7B,SAAO;AAAA,IACL,OAAO,MAAM;AAAA,IACb,OAAO,MAAM,MAAM,IAAI,aAAa;AAAA,IACpC,QAAQ,MAAM;AAAA,EAChB;AACF;AACA,SAAS,iBAAiB,YAAY;AACpC,SAAO;AAAA,IACL,OAAO,WAAW;AAAA,IAClB,OAAO,WAAW,MAAM,IAAI,eAAe;AAAA,IAC3C,QAAQ,WAAW;AAAA,EACrB;AACF;AACA,SAAS,cAAc,MAAM;AAC3B,QAAM,SAAS;AAAA,IACb,GAAG,KAAK;AAAA,IACR,GAAG,KAAK;AAAA,IACR,IAAI,KAAK;AAAA,IACT,GAAG,KAAK;AAAA,IACR,GAAG,KAAK;AAAA,EACV;AACA,MAAI,KAAK,KAAM,QAAO,KAAK,KAAK;AAChC,SAAO;AACT;AACA,SAAS,gBAAgB,MAAM;AAC7B,QAAM,SAAS;AAAA,IACb,QAAQ,KAAK;AAAA,IACb,QAAQ,KAAK;AAAA,IACb,MAAM,KAAK;AAAA,IACX,QAAQ,KAAK;AAAA,IACb,YAAY,KAAK;AAAA,EACnB;AACA,MAAI,KAAK,GAAI,QAAO,OAAO,KAAK;AAChC,SAAO;AACT;","names":[]}

package/dist/graph-6PMJ6XCF.js

@@ -0,0 +1,17 @@
+import {
+  ComponentGraphEngine,
+  EDGE_TYPE_WEIGHTS,
+  GRAPH_EDGE_TYPES,
+  computeHealthFromData,
+  deserializeGraph,
+  serializeGraph
+} from "./chunk-WXUZ55XQ.js";
+export {
+  ComponentGraphEngine,
+  EDGE_TYPE_WEIGHTS,
+  GRAPH_EDGE_TYPES,
+  computeHealthFromData,
+  deserializeGraph,
+  serializeGraph
+};
+//# sourceMappingURL=graph-6PMJ6XCF.js.map

package/dist/graph-6PMJ6XCF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/server.js

@@ -0,0 +1,10 @@
+import {
+  createMcpServer,
+  startMcpServer
+} from "./chunk-EMMM6LTH.js";
+import "./chunk-WXUZ55XQ.js";
+export {
+  createMcpServer,
+  startMcpServer
+};
+//# sourceMappingURL=server.js.map

package/dist/server.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/package.json

@@ -1,6 +1,7 @@
 {
   "name": "@fragments-sdk/mcp",
-  "version": "0.5.0",
+  "version": "0.5.2",
+  "license": "FSL-1.1-MIT",
   "description": "Standalone MCP server for Fragments design system — zero-config component discovery with semantic search",
   "repository": {
     "type": "git",
@@ -19,6 +20,15 @@
       "import": "./dist/server.js"
     }
   },
+  "keywords": [
+    "mcp",
+    "model-context-protocol",
+    "ai",
+    "design-system",
+    "component-library",
+    "react",
+    "code-generation"
+  ],
   "publishConfig": {
     "access": "public"
   },
@@ -35,7 +45,7 @@
     "tsx": "^4.19.0",
     "typescript": "^5.7.2",
     "vitest": "^2.1.8",
-    "@fragments-sdk/context": "0.3.0"
+    "@fragments-sdk/context": "0.3.1"
   },
   "scripts": {
     "build": "tsup",