@graphrs/core 0.0.0-canary.de24fef

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024-present Totoro-jam
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/index.d.ts

@@ -0,0 +1,151 @@
+type VertexId = number;
+type EdgeId = number;
+interface GraphOptions {
+    directed?: boolean;
+}
+interface NodeData {
+    [key: string]: unknown;
+}
+interface EdgeData {
+    weight?: number;
+    [key: string]: unknown;
+}
+interface SerializedGraph {
+    directed: boolean;
+    nodes: Array<{
+        id: VertexId;
+        data?: Record<string, unknown>;
+    }>;
+    edges: Array<{
+        source: VertexId;
+        target: VertexId;
+        data?: Record<string, unknown>;
+    }>;
+}
+interface CommunityResult {
+    membership: number[];
+    modularity: number;
+    clusters: number;
+}
+interface CentralityResult {
+    scores: number[];
+}
+interface LayoutResult {
+    positions: [number, number][];
+}
+interface Layout3DResult {
+    positions: [number, number, number][];
+}
+interface PathResult {
+    path: number[];
+    distance: number;
+}
+interface FlowResult {
+    value: number;
+    flow: number[];
+}
+interface G6GraphData {
+    nodes: Array<{
+        id: string;
+        x?: number;
+        y?: number;
+        [key: string]: unknown;
+    }>;
+    edges: Array<{
+        source: string;
+        target: string;
+        [key: string]: unknown;
+    }>;
+}
+interface ReactFlowData {
+    nodes: Array<{
+        id: string;
+        position: {
+            x: number;
+            y: number;
+        };
+        data: Record<string, unknown>;
+    }>;
+    edges: Array<{
+        id: string;
+        source: string;
+        target: string;
+    }>;
+}
+interface CytoscapeData {
+    elements: {
+        nodes: Array<{
+            data: {
+                id: string;
+                [key: string]: unknown;
+            };
+        }>;
+        edges: Array<{
+            data: {
+                source: string;
+                target: string;
+                [key: string]: unknown;
+            };
+        }>;
+    };
+}
+interface WasmExports {
+    [key: string]: unknown;
+}
+
+declare class Graph<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+    readonly directed: boolean;
+    private _nodes;
+    private _edges;
+    private _adjacency;
+    constructor(options?: GraphOptions);
+    static fromEdges<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(edges: [number, number][], options?: GraphOptions): Graph<N, E>;
+    static fromAdjacencyMatrix<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(matrix: number[][], options?: GraphOptions): Graph<N, E>;
+    static fromJSON<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(data: SerializedGraph): Graph<N, E>;
+    addNode(id: VertexId, data?: N): this;
+    addEdge(source: VertexId, target: VertexId, data?: E): this;
+    removeNode(id: VertexId): this;
+    removeEdge(source: VertexId, target: VertexId): this;
+    nodeCount(): number;
+    edgeCount(): number;
+    hasNode(id: VertexId): boolean;
+    hasEdge(source: VertexId, target: VertexId): boolean;
+    neighbors(id: VertexId): VertexId[];
+    degree(id: VertexId): number;
+    nodes(): VertexId[];
+    edges(): Array<{
+        source: VertexId;
+        target: VertexId;
+        data: E;
+    }>;
+    nodeData(id: VertexId): N;
+    subgraph(nodeIds: VertexId[]): Graph<N, E>;
+    toJSON(): SerializedGraph;
+    toG6Format(layout?: LayoutResult): G6GraphData;
+    toReactFlowFormat(layout?: LayoutResult): ReactFlowData;
+    toCytoscapeFormat(layout?: LayoutResult): CytoscapeData;
+    _getEdgePairs(): [number, number][];
+    _getWeights(): number[] | null;
+}
+
+declare function getWasm(): Promise<WasmExports>;
+declare function isWasmInitialized(): boolean;
+
+declare class GraphError extends Error {
+    readonly code: string;
+    constructor(code: string, message: string);
+}
+declare class WasmNotInitializedError extends GraphError {
+    constructor();
+}
+declare class NodeNotFoundError extends GraphError {
+    constructor(id: number);
+}
+declare class EdgeNotFoundError extends GraphError {
+    constructor(source: number, target: number);
+}
+declare class WasmError extends GraphError {
+    constructor(message: string);
+}
+
+export { type CentralityResult, type CommunityResult, type CytoscapeData, type EdgeData, type EdgeId, EdgeNotFoundError, type FlowResult, type G6GraphData, Graph, GraphError, type GraphOptions, type Layout3DResult, type LayoutResult, type NodeData, NodeNotFoundError, type PathResult, type ReactFlowData, type SerializedGraph, type VertexId, WasmError, type WasmExports, WasmNotInitializedError, getWasm, isWasmInitialized };

package/dist/index.js

@@ -0,0 +1,278 @@
+// src/errors.ts
+var GraphError = class extends Error {
+  code;
+  constructor(code, message) {
+    super(message);
+    this.name = "GraphError";
+    this.code = code;
+  }
+};
+var WasmNotInitializedError = class extends GraphError {
+  constructor() {
+    super(
+      "WASM_NOT_INITIALIZED",
+      "WASM module has not been initialized. Call an async algorithm function first."
+    );
+  }
+};
+var NodeNotFoundError = class extends GraphError {
+  constructor(id) {
+    super("NODE_NOT_FOUND", `Node ${id} not found in graph`);
+  }
+};
+var EdgeNotFoundError = class extends GraphError {
+  constructor(source, target) {
+    super("EDGE_NOT_FOUND", `Edge (${source}, ${target}) not found in graph`);
+  }
+};
+var WasmError = class extends GraphError {
+  constructor(message) {
+    super("WASM_ERROR", message);
+  }
+};
+
+// src/graph.ts
+var Graph = class _Graph {
+  directed;
+  _nodes = /* @__PURE__ */ new Map();
+  _edges = [];
+  _adjacency = /* @__PURE__ */ new Map();
+  constructor(options) {
+    this.directed = options?.directed ?? false;
+  }
+  static fromEdges(edges, options) {
+    const g = new _Graph(options);
+    for (const [source, target] of edges) {
+      if (!g.hasNode(source)) g.addNode(source);
+      if (!g.hasNode(target)) g.addNode(target);
+      g.addEdge(source, target);
+    }
+    return g;
+  }
+  static fromAdjacencyMatrix(matrix, options) {
+    const g = new _Graph(options);
+    const n = matrix.length;
+    for (let i = 0; i < n; i++) {
+      g.addNode(i);
+    }
+    for (let i = 0; i < n; i++) {
+      for (let j = 0; j < n; j++) {
+        if (matrix[i][j] > 0) {
+          if (!g.directed && j <= i) continue;
+          g.addEdge(i, j, { weight: matrix[i][j] });
+        }
+      }
+    }
+    return g;
+  }
+  static fromJSON(data) {
+    const g = new _Graph({ directed: data.directed });
+    for (const node of data.nodes) {
+      g.addNode(node.id, node.data);
+    }
+    for (const edge of data.edges) {
+      g.addEdge(edge.source, edge.target, edge.data);
+    }
+    return g;
+  }
+  addNode(id, data) {
+    if (!this._nodes.has(id)) {
+      this._nodes.set(id, { id, data: data ?? {} });
+      this._adjacency.set(id, /* @__PURE__ */ new Set());
+    }
+    return this;
+  }
+  addEdge(source, target, data) {
+    if (!this._nodes.has(source)) this.addNode(source);
+    if (!this._nodes.has(target)) this.addNode(target);
+    this._edges.push({ source, target, data: data ?? {} });
+    this._adjacency.get(source).add(target);
+    if (!this.directed) {
+      this._adjacency.get(target).add(source);
+    }
+    return this;
+  }
+  removeNode(id) {
+    if (!this._nodes.has(id)) throw new NodeNotFoundError(id);
+    this._nodes.delete(id);
+    this._adjacency.delete(id);
+    this._edges = this._edges.filter((e) => e.source !== id && e.target !== id);
+    for (const neighbors of this._adjacency.values()) {
+      neighbors.delete(id);
+    }
+    return this;
+  }
+  removeEdge(source, target) {
+    const idx = this._edges.findIndex((e) => e.source === source && e.target === target);
+    if (idx === -1) throw new EdgeNotFoundError(source, target);
+    this._edges.splice(idx, 1);
+    const hasOther = this._edges.some((e) => e.source === source && e.target === target);
+    if (!hasOther) {
+      this._adjacency.get(source)?.delete(target);
+      if (!this.directed) {
+        this._adjacency.get(target)?.delete(source);
+      }
+    }
+    return this;
+  }
+  nodeCount() {
+    return this._nodes.size;
+  }
+  edgeCount() {
+    return this._edges.length;
+  }
+  hasNode(id) {
+    return this._nodes.has(id);
+  }
+  hasEdge(source, target) {
+    return this._edges.some((e) => e.source === source && e.target === target);
+  }
+  neighbors(id) {
+    const adj = this._adjacency.get(id);
+    if (!adj) throw new NodeNotFoundError(id);
+    return [...adj];
+  }
+  degree(id) {
+    const adj = this._adjacency.get(id);
+    if (!adj) throw new NodeNotFoundError(id);
+    return adj.size;
+  }
+  nodes() {
+    return [...this._nodes.keys()];
+  }
+  edges() {
+    return this._edges.map((e) => ({ source: e.source, target: e.target, data: e.data }));
+  }
+  nodeData(id) {
+    const node = this._nodes.get(id);
+    if (!node) throw new NodeNotFoundError(id);
+    return node.data;
+  }
+  subgraph(nodeIds) {
+    const nodeSet = new Set(nodeIds);
+    const g = new _Graph({ directed: this.directed });
+    for (const id of nodeIds) {
+      if (this._nodes.has(id)) {
+        g.addNode(id, this._nodes.get(id).data);
+      }
+    }
+    for (const edge of this._edges) {
+      if (nodeSet.has(edge.source) && nodeSet.has(edge.target)) {
+        g.addEdge(edge.source, edge.target, edge.data);
+      }
+    }
+    return g;
+  }
+  toJSON() {
+    return {
+      directed: this.directed,
+      nodes: [...this._nodes.values()].map((n) => ({
+        id: n.id,
+        data: n.data
+      })),
+      edges: this._edges.map((e) => ({
+        source: e.source,
+        target: e.target,
+        data: e.data
+      }))
+    };
+  }
+  toG6Format(layout) {
+    const nodes = [...this._nodes.values()].map((n, i) => ({
+      id: String(n.id),
+      ...layout ? { x: layout.positions[i][0], y: layout.positions[i][1] } : {},
+      ...n.data
+    }));
+    const edgesOut = this._edges.map((e) => ({
+      source: String(e.source),
+      target: String(e.target),
+      ...e.data
+    }));
+    return { nodes, edges: edgesOut };
+  }
+  toReactFlowFormat(layout) {
+    const nodes = [...this._nodes.values()].map((n, i) => ({
+      id: String(n.id),
+      position: layout ? { x: layout.positions[i][0], y: layout.positions[i][1] } : { x: 0, y: 0 },
+      data: n.data
+    }));
+    const edgesOut = this._edges.map((e, i) => ({
+      id: `e-${i}`,
+      source: String(e.source),
+      target: String(e.target)
+    }));
+    return { nodes, edges: edgesOut };
+  }
+  toCytoscapeFormat(layout) {
+    const nodes = [...this._nodes.values()].map((n, i) => ({
+      data: {
+        id: String(n.id),
+        ...layout ? { x: layout.positions[i][0], y: layout.positions[i][1] } : {},
+        ...n.data
+      }
+    }));
+    const edgesOut = this._edges.map((e) => ({
+      data: {
+        source: String(e.source),
+        target: String(e.target),
+        ...e.data
+      }
+    }));
+    return { elements: { nodes, edges: edgesOut } };
+  }
+  _getEdgePairs() {
+    return this._edges.map((e) => [e.source, e.target]);
+  }
+  _getWeights() {
+    const hasWeights = this._edges.some((e) => e.data.weight !== void 0);
+    if (!hasWeights) return null;
+    return this._edges.map((e) => e.data.weight ?? 1);
+  }
+};
+
+// src/wasm-loader.ts
+var wasmInstance = null;
+var initPromise = null;
+function detectEnvironment() {
+  if (typeof globalThis.process !== "undefined" && globalThis.process.versions?.node) {
+    return "node";
+  }
+  return "browser";
+}
+async function initWasm() {
+  const env = detectEnvironment();
+  if (env === "node") {
+    const { readFile } = await import('fs/promises');
+    const { fileURLToPath } = await import('url');
+    const { dirname, join } = await import('path');
+    const currentDir = dirname(fileURLToPath(import.meta.url));
+    const wasmPath = join(currentDir, "..", "wasm", "igraph_wasm_bg.wasm");
+    const jsGluePath = join(currentDir, "..", "wasm", "igraph_wasm.js");
+    const initFn = (await import(jsGluePath)).default;
+    const wasmBytes = await readFile(wasmPath);
+    wasmInstance = await initFn(wasmBytes);
+  } else {
+    const wasmUrl = new URL("../wasm/igraph_wasm_bg.wasm", import.meta.url);
+    const jsGlueUrl = new URL("../wasm/igraph_wasm.js", import.meta.url);
+    const initFn = (await import(
+      /* @vite-ignore */
+      jsGlueUrl.href
+    )).default;
+    wasmInstance = await initFn(wasmUrl);
+  }
+  return wasmInstance;
+}
+async function getWasm() {
+  if (wasmInstance) return wasmInstance;
+  if (!initPromise) {
+    initPromise = initWasm();
+  }
+  return initPromise;
+}
+function isWasmInitialized() {
+  return wasmInstance !== null;
+}
+
+export { EdgeNotFoundError, Graph, GraphError, NodeNotFoundError, WasmError, WasmNotInitializedError, getWasm, isWasmInitialized };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/errors.ts","../src/graph.ts","../src/wasm-loader.ts"],"names":[],"mappings":";AAAO,IAAM,UAAA,GAAN,cAAyB,KAAA,CAAM;AAAA,EAC3B,IAAA;AAAA,EAET,WAAA,CAAY,MAAc,OAAA,EAAiB;AACzC,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,YAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AAAA,EACd;AACF;AAEO,IAAM,uBAAA,GAAN,cAAsC,UAAA,CAAW;AAAA,EACtD,WAAA,GAAc;AACZ,IAAA,KAAA;AAAA,MACE,sBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AACF;AAEO,IAAM,iBAAA,GAAN,cAAgC,UAAA,CAAW;AAAA,EAChD,YAAY,EAAA,EAAY;AACtB,IAAA,KAAA,CAAM,gBAAA,EAAkB,CAAA,KAAA,EAAQ,EAAE,CAAA,mBAAA,CAAqB,CAAA;AAAA,EACzD;AACF;AAEO,IAAM,iBAAA,GAAN,cAAgC,UAAA,CAAW;AAAA,EAChD,WAAA,CAAY,QAAgB,MAAA,EAAgB;AAC1C,IAAA,KAAA,CAAM,gBAAA,EAAkB,CAAA,MAAA,EAAS,MAAM,CAAA,EAAA,EAAK,MAAM,CAAA,oBAAA,CAAsB,CAAA;AAAA,EAC1E;AACF;AAEO,IAAM,SAAA,GAAN,cAAwB,UAAA,CAAW;AAAA,EACxC,YAAY,OAAA,EAAiB;AAC3B,IAAA,KAAA,CAAM,cAAc,OAAO,CAAA;AAAA,EAC7B;AACF;;;ACXO,IAAM,KAAA,GAAN,MAAM,MAAA,CAAoE;AAAA,EACtE,QAAA;AAAA,EAED,MAAA,uBAA6C,GAAA,EAAI;AAAA,EACjD,SAA4B,EAAC;AAAA,EAC7B,UAAA,uBAA+C,GAAA,EAAI;AAAA,EAE3D,YAAY,OAAA,EAAwB;AAClC,IAAA,IAAA,CAAK,QAAA,GAAW,SAAS,QAAA,IAAY,KAAA;AAAA,EACvC;AAAA,EAEA,OAAO,SAAA,CACL,KAAA,EACA,OAAA,EACa;AACb,IAAA,MAAM,CAAA,GAAI,IAAI,MAAA,CAAY,OAAO,CAAA;AACjC,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,MAAM,CAAA,IAAK,KAAA,EAAO;AACpC,MAAA,IAAI,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA,CAAE,QAAQ,MAAM,CAAA;AACxC,MAAA,IAAI,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA,CAAE,QAAQ,MAAM,CAAA;AACxC,MAAA,CAAA,CAAE,OAAA,CAAQ,QAAQ,MAAM,CAAA;AAAA,IAC1B;AACA,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEA,OAAO,mBAAA,CACL,MAAA,EACA,OAAA,EACa;AACb,IAAA,MAAM,CAAA,GAAI,IAAI,MAAA,CAAY,OAAO,CAAA;AACjC,IAAA,MAAM,IAAI,MAAA,CAAO,MAAA;AACjB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,MAAA,CAAA,CAAE,QAAQ,CAAC,CAAA;AAAA,IACb;AACA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,QAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAG,CAAC,IAAK,CAAA,EAAG;AACtB,UAAA,IAAI,CAAC,CAAA,CAAE,QAAA,IAAY,CAAA,IAAK,CAAA,EAAG;AAC3B,UAAA,CAAA,CAAE,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,EAAE,MAAA,EAAQ,OAAO,CAAC,CAAA,CAAG,CAAC,CAAA,EAAmB,CAAA;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEA,OAAO,SACL,IAAA,EACa;AACb,IAAA,MAAM,IAAI,IAAI,MAAA,CAAY,EAAE,QAAA,EAAU,IAAA,CAAK,UAAU,CAAA;AACrD,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,MAAA,CAAA,CAAE,OAAA,CAAQ,IAAA,CAAK,EAAA,EAAI,IAAA,CAAK,IAAS,CAAA;AAAA,IACnC;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,MAAA,CAAA,CAAE,QAAQ,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAQ,KAAK,IAAS,CAAA;AAAA,IACpD;AACA,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEA,OAAA,CAAQ,IAAc,IAAA,EAAgB;AACpC,IAAA,IAAI,CAAC,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA,EAAG;AACxB,MAAA,IAAA,CAAK,MAAA,CAAO,IAAI,EAAA,EAAI,EAAE,IAAI,IAAA,EAAO,IAAA,IAAQ,EAAC,EAAS,CAAA;AACnD,MAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,EAAA,kBAAI,IAAI,KAAK,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,OAAA,CAAQ,MAAA,EAAkB,MAAA,EAAkB,IAAA,EAAgB;AAC1D,IAAA,IAAI,CAAC,KAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA,EAAG,IAAA,CAAK,QAAQ,MAAM,CAAA;AACjD,IAAA,IAAI,CAAC,KAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA,EAAG,IAAA,CAAK,QAAQ,MAAM,CAAA;AAEjD,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,EAAE,MAAA,EAAQ,QAAQ,IAAA,EAAO,IAAA,IAAQ,EAAC,EAAS,CAAA;AAC5D,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,CAAG,IAAI,MAAM,CAAA;AACvC,IAAA,IAAI,CAAC,KAAK,QAAA,EAAU;AAClB,MAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,CAAG,IAAI,MAAM,CAAA;AAAA,IACzC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,WAAW,EAAA,EAAoB;AAC7B,IAAA,IAAI,CAAC,KAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA,EAAG,MAAM,IAAI,iBAAA,CAAkB,EAAE,CAAA;AAExD,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,EAAE,CAAA;AACrB,IAAA,IAAA,CAAK,UAAA,CAAW,OAAO,EAAE,CAAA;AACzB,IAAA,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,EAAA,IAAM,CAAA,CAAE,MAAA,KAAW,EAAE,CAAA;AAE1E,IAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,UAAA,CAAW,MAAA,EAAO,EAAG;AAChD,MAAA,SAAA,CAAU,OAAO,EAAE,CAAA;AAAA,IACrB;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,UAAA,CAAW,QAAkB,MAAA,EAAwB;AACnD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,MAAA,KAAW,MAAM,CAAA;AACnF,IAAA,IAAI,QAAQ,EAAA,EAAI,MAAM,IAAI,iBAAA,CAAkB,QAAQ,MAAM,CAAA;AAE1D,IAAA,IAAA,CAAK,MAAA,CAAO,MAAA,CAAO,GAAA,EAAK,CAAC,CAAA;AACzB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,MAAA,KAAW,MAAM,CAAA;AACnF,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,MAAM,CAAA;AAC1C,MAAA,IAAI,CAAC,KAAK,QAAA,EAAU;AAClB,QAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,MAAM,CAAA;AAAA,MAC5C;AAAA,IACF;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,SAAA,GAAoB;AAClB,IAAA,OAAO,KAAK,MAAA,CAAO,IAAA;AAAA,EACrB;AAAA,EAEA,SAAA,GAAoB;AAClB,IAAA,OAAO,KAAK,MAAA,CAAO,MAAA;AAAA,EACrB;AAAA,EAEA,QAAQ,EAAA,EAAuB;AAC7B,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAAA,EAC3B;AAAA,EAEA,OAAA,CAAQ,QAAkB,MAAA,EAA2B;AACnD,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,EAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,MAAA,KAAW,MAAM,CAAA;AAAA,EAC3E;AAAA,EAEA,UAAU,EAAA,EAA0B;AAClC,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,EAAE,CAAA;AAClC,IAAA,IAAI,CAAC,GAAA,EAAK,MAAM,IAAI,kBAAkB,EAAE,CAAA;AACxC,IAAA,OAAO,CAAC,GAAG,GAAG,CAAA;AAAA,EAChB;AAAA,EAEA,OAAO,EAAA,EAAsB;AAC3B,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,EAAE,CAAA;AAClC,IAAA,IAAI,CAAC,GAAA,EAAK,MAAM,IAAI,kBAAkB,EAAE,CAAA;AACxC,IAAA,OAAO,GAAA,CAAI,IAAA;AAAA,EACb;AAAA,EAEA,KAAA,GAAoB;AAClB,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AAAA,EAC/B;AAAA,EAEA,KAAA,GAAgE;AAC9D,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,OAAO,EAAE,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,QAAQ,CAAA,CAAE,MAAA,EAAQ,IAAA,EAAM,CAAA,CAAE,MAAK,CAAE,CAAA;AAAA,EACtF;AAAA,EAEA,SAAS,EAAA,EAAiB;AACxB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAC/B,IAAA,IAAI,CAAC,IAAA,EAAM,MAAM,IAAI,kBAAkB,EAAE,CAAA;AACzC,IAAA,OAAO,IAAA,CAAK,IAAA;AAAA,EACd;AAAA,EAEA,SAAS,OAAA,EAAkC;AACzC,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,OAAO,CAAA;AAC/B,IAAA,MAAM,IAAI,IAAI,MAAA,CAAY,EAAE,QAAA,EAAU,IAAA,CAAK,UAAU,CAAA;AACrD,IAAA,KAAA,MAAW,MAAM,OAAA,EAAS;AACxB,MAAA,IAAI,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA,EAAG;AACvB,QAAA,CAAA,CAAE,QAAQ,EAAA,EAAI,IAAA,CAAK,OAAO,GAAA,CAAI,EAAE,EAAG,IAAI,CAAA;AAAA,MACzC;AAAA,IACF;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,MAAA,EAAQ;AAC9B,MAAA,IAAI,OAAA,CAAQ,IAAI,IAAA,CAAK,MAAM,KAAK,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AACxD,QAAA,CAAA,CAAE,QAAQ,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAQ,KAAK,IAAI,CAAA;AAAA,MAC/C;AAAA,IACF;AACA,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EAEA,MAAA,GAA0B;AACxB,IAAA,OAAO;AAAA,MACL,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,KAAA,EAAO,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,QAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC3C,IAAI,CAAA,CAAE,EAAA;AAAA,QACN,MAAM,CAAA,CAAE;AAAA,OACV,CAAE,CAAA;AAAA,MACF,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC7B,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,MAAM,CAAA,CAAE;AAAA,OACV,CAAE;AAAA,KACJ;AAAA,EACF;AAAA,EAEA,WAAW,MAAA,EAAoC;AAC7C,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,MACrD,EAAA,EAAI,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA;AAAA,MACf,GAAI,MAAA,GAAS,EAAE,GAAG,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAAG,CAAC,CAAA,EAAG,CAAA,EAAG,OAAO,SAAA,CAAU,CAAC,EAAG,CAAC,CAAA,KAAM,EAAC;AAAA,MAC3E,GAAI,CAAA,CAAE;AAAA,KACR,CAAE,CAAA;AACF,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACvC,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAAA,MACvB,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAAA,MACvB,GAAI,CAAA,CAAE;AAAA,KACR,CAAE,CAAA;AACF,IAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,QAAA,EAAS;AAAA,EAClC;AAAA,EAEA,kBAAkB,MAAA,EAAsC;AACtD,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,MACrD,EAAA,EAAI,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA;AAAA,MACf,QAAA,EAAU,SACN,EAAE,CAAA,EAAG,OAAO,SAAA,CAAU,CAAC,CAAA,CAAG,CAAC,CAAA,EAAI,CAAA,EAAG,OAAO,SAAA,CAAU,CAAC,EAAG,CAAC,CAAA,KACxD,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAE;AAAA,MACjB,MAAM,CAAA,CAAE;AAAA,KACV,CAAE,CAAA;AACF,IAAA,MAAM,WAAW,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,GAAG,CAAA,MAAO;AAAA,MAC1C,EAAA,EAAI,KAAK,CAAC,CAAA,CAAA;AAAA,MACV,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAAA,MACvB,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM;AAAA,KACzB,CAAE,CAAA;AACF,IAAA,OAAO,EAAE,KAAA,EAAO,KAAA,EAAO,QAAA,EAAS;AAAA,EAClC;AAAA,EAEA,kBAAkB,MAAA,EAAsC;AACtD,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO;AAAA,MACrD,IAAA,EAAM;AAAA,QACJ,EAAA,EAAI,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA;AAAA,QACf,GAAI,MAAA,GAAS,EAAE,GAAG,MAAA,CAAO,SAAA,CAAU,CAAC,CAAA,CAAG,CAAC,CAAA,EAAG,CAAA,EAAG,OAAO,SAAA,CAAU,CAAC,EAAG,CAAC,CAAA,KAAM,EAAC;AAAA,QAC3E,GAAI,CAAA,CAAE;AAAA;AACR,KACF,CAAE,CAAA;AACF,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACvC,IAAA,EAAM;AAAA,QACJ,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAAA,QACvB,MAAA,EAAQ,MAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAAA,QACvB,GAAI,CAAA,CAAE;AAAA;AACR,KACF,CAAE,CAAA;AACF,IAAA,OAAO,EAAE,QAAA,EAAU,EAAE,KAAA,EAAO,KAAA,EAAO,UAAS,EAAE;AAAA,EAChD;AAAA,EAEA,aAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAC,CAAA;AAAA,EACpD;AAAA,EAEA,WAAA,GAA+B;AAC7B,IAAA,MAAM,UAAA,GAAa,KAAK,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,MAAA,KAAW,MAAS,CAAA;AACtE,IAAA,IAAI,CAAC,YAAY,OAAO,IAAA;AACxB,IAAA,OAAO,IAAA,CAAK,OAAO,GAAA,CAAI,CAAC,MAAO,CAAA,CAAE,IAAA,CAAK,UAAqB,CAAG,CAAA;AAAA,EAChE;AACF;;;ACjQA,IAAI,YAAA,GAAmC,IAAA;AACvC,IAAI,WAAA,GAA2C,IAAA;AAE/C,SAAS,iBAAA,GAAwC;AAC/C,EAAA,IAAI,OAAO,UAAA,CAAW,OAAA,KAAY,eAAe,UAAA,CAAW,OAAA,CAAQ,UAAU,IAAA,EAAM;AAClF,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,OAAO,SAAA;AACT;AAEA,eAAe,QAAA,GAAiC;AAC9C,EAAA,MAAM,MAAM,iBAAA,EAAkB;AAE9B,EAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,IAAA,MAAM,EAAE,QAAA,EAAS,GAAI,MAAM,OAAO,aAAkB,CAAA;AACpD,IAAA,MAAM,EAAE,aAAA,EAAc,GAAI,MAAM,OAAO,KAAU,CAAA;AACjD,IAAA,MAAM,EAAE,OAAA,EAAS,IAAA,EAAK,GAAI,MAAM,OAAO,MAAW,CAAA;AAElD,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,aAAA,CAAc,MAAA,CAAA,IAAA,CAAY,GAAG,CAAC,CAAA;AACzD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,EAAY,IAAA,EAAM,QAAQ,qBAAqB,CAAA;AACrE,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,EAAY,IAAA,EAAM,QAAQ,gBAAgB,CAAA;AAElE,IAAA,MAAM,MAAA,GAAA,CAAU,MAAM,OAAO,UAAA,CAAA,EAAa,OAAA;AAC1C,IAAA,MAAM,SAAA,GAAY,MAAM,QAAA,CAAS,QAAQ,CAAA;AACzC,IAAA,YAAA,GAAe,MAAM,OAAO,SAAS,CAAA;AAAA,EACvC,CAAA,MAAO;AACL,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,6BAAA,EAA+B,YAAY,GAAG,CAAA;AACtE,IAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,wBAAA,EAA0B,YAAY,GAAG,CAAA;AAEnE,IAAA,MAAM,UAAU,MAAM;AAAA;AAAA,MAA0B,SAAA,CAAU;AAAA,KAAA,EAAO,OAAA;AACjE,IAAA,YAAA,GAAe,MAAM,OAAO,OAAO,CAAA;AAAA,EACrC;AAEA,EAAA,OAAO,YAAA;AACT;AAEA,eAAsB,OAAA,GAAgC;AACpD,EAAA,IAAI,cAAc,OAAO,YAAA;AACzB,EAAA,IAAI,CAAC,WAAA,EAAa;AAChB,IAAA,WAAA,GAAc,QAAA,EAAS;AAAA,EACzB;AACA,EAAA,OAAO,WAAA;AACT;AAMO,SAAS,iBAAA,GAA6B;AAC3C,EAAA,OAAO,YAAA,KAAiB,IAAA;AAC1B","file":"index.js","sourcesContent":["export class GraphError extends Error {\n  readonly code: string;\n\n  constructor(code: string, message: string) {\n    super(message);\n    this.name = 'GraphError';\n    this.code = code;\n  }\n}\n\nexport class WasmNotInitializedError extends GraphError {\n  constructor() {\n    super(\n      'WASM_NOT_INITIALIZED',\n      'WASM module has not been initialized. Call an async algorithm function first.',\n    );\n  }\n}\n\nexport class NodeNotFoundError extends GraphError {\n  constructor(id: number) {\n    super('NODE_NOT_FOUND', `Node ${id} not found in graph`);\n  }\n}\n\nexport class EdgeNotFoundError extends GraphError {\n  constructor(source: number, target: number) {\n    super('EDGE_NOT_FOUND', `Edge (${source}, ${target}) not found in graph`);\n  }\n}\n\nexport class WasmError extends GraphError {\n  constructor(message: string) {\n    super('WASM_ERROR', message);\n  }\n}\n","import type {\n  VertexId,\n  NodeData,\n  EdgeData,\n  GraphOptions,\n  SerializedGraph,\n  LayoutResult,\n  G6GraphData,\n  ReactFlowData,\n  CytoscapeData,\n} from './types.js';\nimport { NodeNotFoundError, EdgeNotFoundError } from './errors.js';\n\ninterface InternalNode<N> {\n  id: VertexId;\n  data: N;\n}\n\ninterface InternalEdge<E> {\n  source: VertexId;\n  target: VertexId;\n  data: E;\n}\n\nexport class Graph<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {\n  readonly directed: boolean;\n\n  private _nodes: Map<VertexId, InternalNode<N>> = new Map();\n  private _edges: InternalEdge<E>[] = [];\n  private _adjacency: Map<VertexId, Set<VertexId>> = new Map();\n\n  constructor(options?: GraphOptions) {\n    this.directed = options?.directed ?? false;\n  }\n\n  static fromEdges<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(\n    edges: [number, number][],\n    options?: GraphOptions,\n  ): Graph<N, E> {\n    const g = new Graph<N, E>(options);\n    for (const [source, target] of edges) {\n      if (!g.hasNode(source)) g.addNode(source);\n      if (!g.hasNode(target)) g.addNode(target);\n      g.addEdge(source, target);\n    }\n    return g;\n  }\n\n  static fromAdjacencyMatrix<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(\n    matrix: number[][],\n    options?: GraphOptions,\n  ): Graph<N, E> {\n    const g = new Graph<N, E>(options);\n    const n = matrix.length;\n    for (let i = 0; i < n; i++) {\n      g.addNode(i);\n    }\n    for (let i = 0; i < n; i++) {\n      for (let j = 0; j < n; j++) {\n        if (matrix[i]![j]! > 0) {\n          if (!g.directed && j <= i) continue;\n          g.addEdge(i, j, { weight: matrix[i]![j] } as unknown as E);\n        }\n      }\n    }\n    return g;\n  }\n\n  static fromJSON<N extends NodeData = NodeData, E extends EdgeData = EdgeData>(\n    data: SerializedGraph,\n  ): Graph<N, E> {\n    const g = new Graph<N, E>({ directed: data.directed });\n    for (const node of data.nodes) {\n      g.addNode(node.id, node.data as N);\n    }\n    for (const edge of data.edges) {\n      g.addEdge(edge.source, edge.target, edge.data as E);\n    }\n    return g;\n  }\n\n  addNode(id: VertexId, data?: N): this {\n    if (!this._nodes.has(id)) {\n      this._nodes.set(id, { id, data: (data ?? {}) as N });\n      this._adjacency.set(id, new Set());\n    }\n    return this;\n  }\n\n  addEdge(source: VertexId, target: VertexId, data?: E): this {\n    if (!this._nodes.has(source)) this.addNode(source);\n    if (!this._nodes.has(target)) this.addNode(target);\n\n    this._edges.push({ source, target, data: (data ?? {}) as E });\n    this._adjacency.get(source)!.add(target);\n    if (!this.directed) {\n      this._adjacency.get(target)!.add(source);\n    }\n    return this;\n  }\n\n  removeNode(id: VertexId): this {\n    if (!this._nodes.has(id)) throw new NodeNotFoundError(id);\n\n    this._nodes.delete(id);\n    this._adjacency.delete(id);\n    this._edges = this._edges.filter((e) => e.source !== id && e.target !== id);\n\n    for (const neighbors of this._adjacency.values()) {\n      neighbors.delete(id);\n    }\n    return this;\n  }\n\n  removeEdge(source: VertexId, target: VertexId): this {\n    const idx = this._edges.findIndex((e) => e.source === source && e.target === target);\n    if (idx === -1) throw new EdgeNotFoundError(source, target);\n\n    this._edges.splice(idx, 1);\n    const hasOther = this._edges.some((e) => e.source === source && e.target === target);\n    if (!hasOther) {\n      this._adjacency.get(source)?.delete(target);\n      if (!this.directed) {\n        this._adjacency.get(target)?.delete(source);\n      }\n    }\n    return this;\n  }\n\n  nodeCount(): number {\n    return this._nodes.size;\n  }\n\n  edgeCount(): number {\n    return this._edges.length;\n  }\n\n  hasNode(id: VertexId): boolean {\n    return this._nodes.has(id);\n  }\n\n  hasEdge(source: VertexId, target: VertexId): boolean {\n    return this._edges.some((e) => e.source === source && e.target === target);\n  }\n\n  neighbors(id: VertexId): VertexId[] {\n    const adj = this._adjacency.get(id);\n    if (!adj) throw new NodeNotFoundError(id);\n    return [...adj];\n  }\n\n  degree(id: VertexId): number {\n    const adj = this._adjacency.get(id);\n    if (!adj) throw new NodeNotFoundError(id);\n    return adj.size;\n  }\n\n  nodes(): VertexId[] {\n    return [...this._nodes.keys()];\n  }\n\n  edges(): Array<{ source: VertexId; target: VertexId; data: E }> {\n    return this._edges.map((e) => ({ source: e.source, target: e.target, data: e.data }));\n  }\n\n  nodeData(id: VertexId): N {\n    const node = this._nodes.get(id);\n    if (!node) throw new NodeNotFoundError(id);\n    return node.data;\n  }\n\n  subgraph(nodeIds: VertexId[]): Graph<N, E> {\n    const nodeSet = new Set(nodeIds);\n    const g = new Graph<N, E>({ directed: this.directed });\n    for (const id of nodeIds) {\n      if (this._nodes.has(id)) {\n        g.addNode(id, this._nodes.get(id)!.data);\n      }\n    }\n    for (const edge of this._edges) {\n      if (nodeSet.has(edge.source) && nodeSet.has(edge.target)) {\n        g.addEdge(edge.source, edge.target, edge.data);\n      }\n    }\n    return g;\n  }\n\n  toJSON(): SerializedGraph {\n    return {\n      directed: this.directed,\n      nodes: [...this._nodes.values()].map((n) => ({\n        id: n.id,\n        data: n.data as Record<string, unknown>,\n      })),\n      edges: this._edges.map((e) => ({\n        source: e.source,\n        target: e.target,\n        data: e.data as Record<string, unknown>,\n      })),\n    };\n  }\n\n  toG6Format(layout?: LayoutResult): G6GraphData {\n    const nodes = [...this._nodes.values()].map((n, i) => ({\n      id: String(n.id),\n      ...(layout ? { x: layout.positions[i]![0], y: layout.positions[i]![1] } : {}),\n      ...(n.data as Record<string, unknown>),\n    }));\n    const edgesOut = this._edges.map((e) => ({\n      source: String(e.source),\n      target: String(e.target),\n      ...(e.data as Record<string, unknown>),\n    }));\n    return { nodes, edges: edgesOut };\n  }\n\n  toReactFlowFormat(layout?: LayoutResult): ReactFlowData {\n    const nodes = [...this._nodes.values()].map((n, i) => ({\n      id: String(n.id),\n      position: layout\n        ? { x: layout.positions[i]![0]!, y: layout.positions[i]![1]! }\n        : { x: 0, y: 0 },\n      data: n.data as Record<string, unknown>,\n    }));\n    const edgesOut = this._edges.map((e, i) => ({\n      id: `e-${i}`,\n      source: String(e.source),\n      target: String(e.target),\n    }));\n    return { nodes, edges: edgesOut };\n  }\n\n  toCytoscapeFormat(layout?: LayoutResult): CytoscapeData {\n    const nodes = [...this._nodes.values()].map((n, i) => ({\n      data: {\n        id: String(n.id),\n        ...(layout ? { x: layout.positions[i]![0], y: layout.positions[i]![1] } : {}),\n        ...(n.data as Record<string, unknown>),\n      },\n    }));\n    const edgesOut = this._edges.map((e) => ({\n      data: {\n        source: String(e.source),\n        target: String(e.target),\n        ...(e.data as Record<string, unknown>),\n      },\n    }));\n    return { elements: { nodes, edges: edgesOut } };\n  }\n\n  _getEdgePairs(): [number, number][] {\n    return this._edges.map((e) => [e.source, e.target]);\n  }\n\n  _getWeights(): number[] | null {\n    const hasWeights = this._edges.some((e) => e.data.weight !== undefined);\n    if (!hasWeights) return null;\n    return this._edges.map((e) => (e.data.weight as number) ?? 1.0);\n  }\n}\n","import type { WasmExports } from './types.js';\n\nlet wasmInstance: WasmExports | null = null;\nlet initPromise: Promise<WasmExports> | null = null;\n\nfunction detectEnvironment(): 'browser' | 'node' {\n  if (typeof globalThis.process !== 'undefined' && globalThis.process.versions?.node) {\n    return 'node';\n  }\n  return 'browser';\n}\n\nasync function initWasm(): Promise<WasmExports> {\n  const env = detectEnvironment();\n\n  if (env === 'node') {\n    const { readFile } = await import('node:fs/promises');\n    const { fileURLToPath } = await import('node:url');\n    const { dirname, join } = await import('node:path');\n\n    const currentDir = dirname(fileURLToPath(import.meta.url));\n    const wasmPath = join(currentDir, '..', 'wasm', 'igraph_wasm_bg.wasm');\n    const jsGluePath = join(currentDir, '..', 'wasm', 'igraph_wasm.js');\n\n    const initFn = (await import(jsGluePath)).default;\n    const wasmBytes = await readFile(wasmPath);\n    wasmInstance = await initFn(wasmBytes);\n  } else {\n    const wasmUrl = new URL('../wasm/igraph_wasm_bg.wasm', import.meta.url);\n    const jsGlueUrl = new URL('../wasm/igraph_wasm.js', import.meta.url);\n\n    const initFn = (await import(/* @vite-ignore */ jsGlueUrl.href)).default;\n    wasmInstance = await initFn(wasmUrl);\n  }\n\n  return wasmInstance!;\n}\n\nexport async function getWasm(): Promise<WasmExports> {\n  if (wasmInstance) return wasmInstance;\n  if (!initPromise) {\n    initPromise = initWasm();\n  }\n  return initPromise;\n}\n\nexport function getWasmSync(): WasmExports | null {\n  return wasmInstance;\n}\n\nexport function isWasmInitialized(): boolean {\n  return wasmInstance !== null;\n}\n"]}

package/dist/worker.d.ts

@@ -0,0 +1,7 @@
+interface GraphWorker {
+    run<T>(fn: (graphrs: unknown) => T | Promise<T>): Promise<T>;
+    terminate(): void;
+}
+declare function createGraphWorker(): GraphWorker;
+
+export { type GraphWorker, createGraphWorker };

package/dist/worker.js

@@ -0,0 +1,10 @@
+// src/worker.ts
+function createGraphWorker() {
+  throw new Error(
+    "Web Worker support is not yet implemented. Use the main thread API for now. Worker support coming in v0.2.0."
+  );
+}
+
+export { createGraphWorker };
+//# sourceMappingURL=worker.js.map
+//# sourceMappingURL=worker.js.map

package/dist/worker.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/worker.ts"],"names":[],"mappings":";AAKO,SAAS,iBAAA,GAAiC;AAC/C,EAAA,MAAM,IAAI,KAAA;AAAA,IACR;AAAA,GAEF;AACF","file":"worker.js","sourcesContent":["export interface GraphWorker {\n  run<T>(fn: (graphrs: unknown) => T | Promise<T>): Promise<T>;\n  terminate(): void;\n}\n\nexport function createGraphWorker(): GraphWorker {\n  throw new Error(\n    'Web Worker support is not yet implemented. ' +\n      'Use the main thread API for now. Worker support coming in v0.2.0.',\n  );\n}\n"]}

package/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@graphrs/core",
+  "version": "0.0.0-canary.de24fef",
+  "type": "module",
+  "license": "MIT",
+  "description": "Core graph data structure and WASM runtime for @graphrs — high-performance graph algorithms via WebAssembly",
+  "keywords": [
+    "graph",
+    "wasm",
+    "webassembly",
+    "graph-algorithms",
+    "network-analysis"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/Totoro-jam/graphrs",
+    "directory": "packages/core"
+  },
+  "author": "Totoro-jam <moqiuchen66@gmail.com>",
+  "homepage": "https://github.com/Totoro-jam/graphrs#readme",
+  "bugs": {
+    "url": "https://github.com/Totoro-jam/graphrs/issues"
+  },
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "./worker": {
+      "types": "./dist/worker.d.ts",
+      "import": "./dist/worker.js"
+    }
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist",
+    "wasm/*.wasm",
+    "wasm/*.js",
+    "wasm/*.d.ts"
+  ],
+  "engines": {
+    "node": ">=20.0.0"
+  },
+  "scripts": {
+    "build": "tsup",
+    "test": "vitest run --passWithNoTests",
+    "test:ci": "vitest run --reporter=default --passWithNoTests",
+    "lint": "tsc --noEmit",
+    "typecheck": "tsc --noEmit",
+    "clean": "rm -rf dist"
+  }
+}