@graphrs/core 0.1.0 → 0.2.0

package/dist/index.d.ts

@@ -89,9 +89,6 @@ interface CytoscapeData {
         }>;
     };
 }
-interface WasmExports {
-    [key: string]: unknown;
-}
 
 declare class Graph<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
     readonly directed: boolean;
@@ -128,7 +125,93 @@ declare class Graph<N extends NodeData = NodeData, E extends EdgeData = EdgeData
     _getWeights(): number[] | null;
 }
 
-declare function getWasm(): Promise<WasmExports>;
+interface WasmGraphClass {
+    fromEdges(edges_flat: Uint32Array, directed: boolean): WasmGraphInstance;
+    new (directed: boolean): WasmGraphInstance;
+    erdosRenyi(n: number, p: number, seed: bigint): WasmGraphInstance;
+    barabasiAlbert(n: number, m: number, seed: bigint): WasmGraphInstance;
+    wattsStrogatz(n: number, k: number, p: number, seed: bigint): WasmGraphInstance;
+    fullGraph(n: number): WasmGraphInstance;
+    ringGraph(n: number, circular: boolean): WasmGraphInstance;
+    squareLattice(dims: Uint32Array, nei: number, directed: boolean, mutual: boolean): WasmGraphInstance;
+    starGraph(n: number): WasmGraphInstance;
+    karyTree(n: number, children: number, mode: string): WasmGraphInstance;
+    pathGraph(n: number, directed: boolean): WasmGraphInstance;
+    sbmGame(prefMatrixFlat: Float64Array, nBlocks: number, blockSizes: Uint32Array, directed: boolean, seed: number): WasmGraphInstance;
+    readGraphml(text: string): WasmGraphInstance;
+    readGml(text: string): WasmGraphInstance;
+    readEdgelist(text: string): WasmGraphInstance;
+    readPajek(text: string): WasmGraphInstance;
+    readDot(text: string): WasmGraphInstance;
+}
+interface WasmGraphInstance {
+    free(): void;
+    vcount(): number;
+    ecount(): number;
+    getEdges(): Uint32Array;
+    isDirected(): boolean;
+    louvain(): string;
+    leiden(): string;
+    infomap(): string;
+    labelPropagation(): string;
+    walktrap(): string;
+    fastGreedy(): string;
+    spinglass(): string;
+    fluidCommunities(k: number): string;
+    pagerank(): string;
+    betweenness(): string;
+    closeness(): string;
+    eigenvectorCentrality(): string;
+    hubAndAuthorityScores(): string;
+    katzCentrality(): string;
+    harmonicCentrality(): string;
+    dijkstra(source: number, weights: Float64Array): string;
+    bellmanFordDistances(source: number, weights: Float64Array): string;
+    bfs(root: number): string;
+    dfs(root: number): string;
+    floydWarshallDistances(): string;
+    layoutFr(niter: number): string;
+    layoutKamadaKawai(): string;
+    layoutGraphopt(): string;
+    layoutSugiyama(): string;
+    layoutReingoldTilford(root: number): string;
+    layoutCircle(): string;
+    layoutGrid(width: number): string;
+    layoutStar(center: number): string;
+    layoutRandom(seed: bigint): string;
+    layoutMds(): string;
+    layoutDrl(): string;
+    simplify(): WasmGraphInstance;
+    reverse(): WasmGraphInstance;
+    complement(): WasmGraphInstance;
+    union(other: WasmGraphInstance): WasmGraphInstance;
+    intersection(other: WasmGraphInstance): WasmGraphInstance;
+    difference(other: WasmGraphInstance): WasmGraphInstance;
+    toDirected(mode: string): string;
+    toUndirected(mode: string): string;
+    inducedSubgraph(vids: Uint32Array): string;
+    maxFlow(source: number, target: number): string;
+    maxFlowDetailed(source: number, target: number): string;
+    mincut(): string;
+    stMincut(source: number, target: number): string;
+    vertexConnectivity(): string;
+    edgeConnectivity(): string;
+    isConnected(mode: string): boolean;
+    isomorphic(other: WasmGraphInstance): boolean;
+    subisomorphic(other: WasmGraphInstance): boolean;
+    canonicalPermutation(): string;
+    countAutomorphisms(): string;
+    writeGraphml(): string;
+    writeGml(): string;
+    writeDot(): string;
+    writeEdgelist(): string;
+    writePajek(): string;
+    [key: string]: unknown;
+}
+interface WasmModule {
+    WasmGraph: WasmGraphClass;
+}
+declare function getWasm(): Promise<WasmModule>;
 declare function isWasmInitialized(): boolean;
 
 declare class GraphError extends Error {
@@ -148,4 +231,4 @@ 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 };
+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 WasmGraphInstance, type WasmModule, WasmNotInitializedError, getWasm, isWasmInitialized };

package/dist/index.js

@@ -231,7 +231,7 @@ var Graph = class _Graph {
 };
 
 // src/wasm-loader.ts
-var wasmInstance = null;
+var wasmModule = null;
 var initPromise = null;
 function detectEnvironment() {
   if (typeof globalThis.process !== "undefined" && globalThis.process.versions?.node) {
@@ -248,29 +248,31 @@ async function initWasm() {
     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 glueModule = await import(jsGluePath);
     const wasmBytes = await readFile(wasmPath);
-    wasmInstance = await initFn(wasmBytes);
+    await glueModule.default({ module_or_path: wasmBytes });
+    wasmModule = { WasmGraph: glueModule.WasmGraph };
   } 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(
+    const glueModule = await import(
       /* @vite-ignore */
       jsGlueUrl.href
-    )).default;
-    wasmInstance = await initFn(wasmUrl);
+    );
+    await glueModule.default(wasmUrl);
+    wasmModule = { WasmGraph: glueModule.WasmGraph };
   }
-  return wasmInstance;
+  return wasmModule;
 }
 async function getWasm() {
-  if (wasmInstance) return wasmInstance;
+  if (wasmModule) return wasmModule;
   if (!initPromise) {
     initPromise = initWasm();
   }
   return initPromise;
 }
 function isWasmInitialized() {
-  return wasmInstance !== null;
+  return wasmModule !== null;
 }
 
 export { EdgeNotFoundError, Graph, GraphError, NodeNotFoundError, WasmError, WasmNotInitializedError, getWasm, isWasmInitialized };

package/dist/index.js.map

@@ -1 +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"]}
+{"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;;;AC1IA,IAAI,UAAA,GAAgC,IAAA;AACpC,IAAI,WAAA,GAA0C,IAAA;AAE9C,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,GAAgC;AAC7C,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,UAAA,GAAa,MAAM,OAAO,UAAA,CAAA;AAChC,IAAA,MAAM,SAAA,GAAY,MAAM,QAAA,CAAS,QAAQ,CAAA;AACzC,IAAA,MAAM,UAAA,CAAW,OAAA,CAAQ,EAAE,cAAA,EAAgB,WAAW,CAAA;AAEtD,IAAA,UAAA,GAAa,EAAE,SAAA,EAAW,UAAA,CAAW,SAAA,EAAU;AAAA,EACjD,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,aAAa,MAAM;AAAA;AAAA,MAA0B,SAAA,CAAU;AAAA,KAAA;AAC7D,IAAA,MAAM,UAAA,CAAW,QAAQ,OAAO,CAAA;AAEhC,IAAA,UAAA,GAAa,EAAE,SAAA,EAAW,UAAA,CAAW,SAAA,EAAU;AAAA,EACjD;AAEA,EAAA,OAAO,UAAA;AACT;AAEA,eAAsB,OAAA,GAA+B;AACnD,EAAA,IAAI,YAAY,OAAO,UAAA;AACvB,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,UAAA,KAAe,IAAA;AACxB","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","interface WasmGraphClass {\n  fromEdges(edges_flat: Uint32Array, directed: boolean): WasmGraphInstance;\n  new (directed: boolean): WasmGraphInstance;\n\n  // Generators (static factory methods)\n  erdosRenyi(n: number, p: number, seed: bigint): WasmGraphInstance;\n  barabasiAlbert(n: number, m: number, seed: bigint): WasmGraphInstance;\n  wattsStrogatz(n: number, k: number, p: number, seed: bigint): WasmGraphInstance;\n  fullGraph(n: number): WasmGraphInstance;\n  ringGraph(n: number, circular: boolean): WasmGraphInstance;\n  squareLattice(\n    dims: Uint32Array,\n    nei: number,\n    directed: boolean,\n    mutual: boolean,\n  ): WasmGraphInstance;\n  starGraph(n: number): WasmGraphInstance;\n  karyTree(n: number, children: number, mode: string): WasmGraphInstance;\n  pathGraph(n: number, directed: boolean): WasmGraphInstance;\n  sbmGame(\n    prefMatrixFlat: Float64Array,\n    nBlocks: number,\n    blockSizes: Uint32Array,\n    directed: boolean,\n    seed: number,\n  ): WasmGraphInstance;\n\n  // IO readers (static factory methods)\n  readGraphml(text: string): WasmGraphInstance;\n  readGml(text: string): WasmGraphInstance;\n  readEdgelist(text: string): WasmGraphInstance;\n  readPajek(text: string): WasmGraphInstance;\n  readDot(text: string): WasmGraphInstance;\n}\n\nexport interface WasmGraphInstance {\n  free(): void;\n  vcount(): number;\n  ecount(): number;\n  getEdges(): Uint32Array;\n  isDirected(): boolean;\n\n  // Community detection\n  louvain(): string;\n  leiden(): string;\n  infomap(): string;\n  labelPropagation(): string;\n  walktrap(): string;\n  fastGreedy(): string;\n  spinglass(): string;\n  fluidCommunities(k: number): string;\n\n  // Centrality\n  pagerank(): string;\n  betweenness(): string;\n  closeness(): string;\n  eigenvectorCentrality(): string;\n  hubAndAuthorityScores(): string;\n  katzCentrality(): string;\n  harmonicCentrality(): string;\n\n  // Path / traversal\n  dijkstra(source: number, weights: Float64Array): string;\n  bellmanFordDistances(source: number, weights: Float64Array): string;\n  bfs(root: number): string;\n  dfs(root: number): string;\n  floydWarshallDistances(): string;\n\n  // Layout\n  layoutFr(niter: number): string;\n  layoutKamadaKawai(): string;\n  layoutGraphopt(): string;\n  layoutSugiyama(): string;\n  layoutReingoldTilford(root: number): string;\n  layoutCircle(): string;\n  layoutGrid(width: number): string;\n  layoutStar(center: number): string;\n  layoutRandom(seed: bigint): string;\n  layoutMds(): string;\n  layoutDrl(): string;\n\n  // Operators\n  simplify(): WasmGraphInstance;\n  reverse(): WasmGraphInstance;\n  complement(): WasmGraphInstance;\n  union(other: WasmGraphInstance): WasmGraphInstance;\n  intersection(other: WasmGraphInstance): WasmGraphInstance;\n  difference(other: WasmGraphInstance): WasmGraphInstance;\n  toDirected(mode: string): string;\n  toUndirected(mode: string): string;\n  inducedSubgraph(vids: Uint32Array): string;\n\n  // Flow\n  maxFlow(source: number, target: number): string;\n  maxFlowDetailed(source: number, target: number): string;\n  mincut(): string;\n  stMincut(source: number, target: number): string;\n  vertexConnectivity(): string;\n  edgeConnectivity(): string;\n  isConnected(mode: string): boolean;\n\n  // Isomorphism\n  isomorphic(other: WasmGraphInstance): boolean;\n  subisomorphic(other: WasmGraphInstance): boolean;\n  canonicalPermutation(): string;\n  countAutomorphisms(): string;\n\n  // I/O (write)\n  writeGraphml(): string;\n  writeGml(): string;\n  writeDot(): string;\n  writeEdgelist(): string;\n  writePajek(): string;\n\n  [key: string]: unknown;\n}\n\nexport interface WasmModule {\n  WasmGraph: WasmGraphClass;\n}\n\nlet wasmModule: WasmModule | null = null;\nlet initPromise: Promise<WasmModule> | 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<WasmModule> {\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 glueModule = await import(jsGluePath);\n    const wasmBytes = await readFile(wasmPath);\n    await glueModule.default({ module_or_path: wasmBytes });\n\n    wasmModule = { WasmGraph: glueModule.WasmGraph };\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 glueModule = await import(/* @vite-ignore */ jsGlueUrl.href);\n    await glueModule.default(wasmUrl);\n\n    wasmModule = { WasmGraph: glueModule.WasmGraph };\n  }\n\n  return wasmModule;\n}\n\nexport async function getWasm(): Promise<WasmModule> {\n  if (wasmModule) return wasmModule;\n  if (!initPromise) {\n    initPromise = initWasm();\n  }\n  return initPromise;\n}\n\nexport function getWasmSync(): WasmModule | null {\n  return wasmModule;\n}\n\nexport function isWasmInitialized(): boolean {\n  return wasmModule !== null;\n}\n"]}

package/package.json

@@ -1,16 +1,10 @@
 {
   "name": "@graphrs/core",
-  "version": "0.1.0",
+  "version": "0.2.0",
   "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"
-  ],
+  "keywords": ["graph", "wasm", "webassembly", "graph-algorithms", "network-analysis"],
   "repository": {
     "type": "git",
     "url": "https://github.com/Totoro-jam/graphrs",
@@ -18,9 +12,7 @@
   },
   "author": "Totoro-jam <moqiuchen66@gmail.com>",
   "homepage": "https://github.com/Totoro-jam/graphrs#readme",
-  "bugs": {
-    "url": "https://github.com/Totoro-jam/graphrs/issues"
-  },
+  "bugs": { "url": "https://github.com/Totoro-jam/graphrs/issues" },
   "sideEffects": false,
   "exports": {
     ".": {
@@ -40,9 +32,6 @@
     "wasm/*.js",
     "wasm/*.d.ts"
   ],
-  "engines": {
-    "node": ">=20.0.0"
-  },
   "scripts": {
     "build": "tsup",
     "test": "vitest run --passWithNoTests",
@@ -50,5 +39,8 @@
     "lint": "tsc --noEmit",
     "typecheck": "tsc --noEmit",
     "clean": "rm -rf dist"
+  },
+  "engines": {
+    "node": ">=20.0.0"
   }
-}
+}

package/wasm/igraph_wasm.d.ts

@@ -316,6 +316,10 @@ export class WasmGraph {
     radius(): string;
     randomSpanningTree(seed: bigint): string;
     randomWalk(start: number, steps: number, seed: bigint): string;
+    randomWalkNode2vec(start: number, steps: number, p: number, q: number, seed: bigint): string;
+    randomWalks(walks_per_vertex: number, walk_length: number, seed: bigint): string;
+    randomWalksFrom(starts: Uint32Array, walks_per_vertex: number, walk_length: number, seed: bigint): string;
+    randomWalksNode2vec(walks_per_vertex: number, walk_length: number, p: number, q: number, seed: bigint): string;
     reachabilityMatrix(): string;
     static readDl(text: string, directed: boolean): WasmGraph;
     static readDot(text: string): WasmGraph;
@@ -716,6 +720,10 @@ export interface InitOutput {
     readonly wasmgraph_radius: (a: number) => [number, number, number, number];
     readonly wasmgraph_randomSpanningTree: (a: number, b: bigint) => [number, number, number, number];
     readonly wasmgraph_randomWalk: (a: number, b: number, c: number, d: bigint) => [number, number, number, number];
+    readonly wasmgraph_randomWalkNode2vec: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
+    readonly wasmgraph_randomWalks: (a: number, b: number, c: number, d: bigint) => [number, number, number, number];
+    readonly wasmgraph_randomWalksFrom: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
+    readonly wasmgraph_randomWalksNode2vec: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
     readonly wasmgraph_reachabilityMatrix: (a: number) => [number, number, number, number];
     readonly wasmgraph_readDl: (a: number, b: number, c: number) => [number, number, number];
     readonly wasmgraph_readDot: (a: number, b: number) => [number, number, number];

package/wasm/igraph_wasm.js

@@ -5485,6 +5485,109 @@ export class WasmGraph {
             wasm.__wbindgen_free(deferred2_0, deferred2_1, 1);
         }
     }
+    /**
+     * @param {number} start
+     * @param {number} steps
+     * @param {number} p
+     * @param {number} q
+     * @param {bigint} seed
+     * @returns {string}
+     */
+    randomWalkNode2vec(start, steps, p, q, seed) {
+        let deferred2_0;
+        let deferred2_1;
+        try {
+            const ret = wasm.wasmgraph_randomWalkNode2vec(this.__wbg_ptr, start, steps, p, q, seed);
+            var ptr1 = ret[0];
+            var len1 = ret[1];
+            if (ret[3]) {
+                ptr1 = 0; len1 = 0;
+                throw takeFromExternrefTable0(ret[2]);
+            }
+            deferred2_0 = ptr1;
+            deferred2_1 = len1;
+            return getStringFromWasm0(ptr1, len1);
+        } finally {
+            wasm.__wbindgen_free(deferred2_0, deferred2_1, 1);
+        }
+    }
+    /**
+     * @param {number} walks_per_vertex
+     * @param {number} walk_length
+     * @param {bigint} seed
+     * @returns {string}
+     */
+    randomWalks(walks_per_vertex, walk_length, seed) {
+        let deferred2_0;
+        let deferred2_1;
+        try {
+            const ret = wasm.wasmgraph_randomWalks(this.__wbg_ptr, walks_per_vertex, walk_length, seed);
+            var ptr1 = ret[0];
+            var len1 = ret[1];
+            if (ret[3]) {
+                ptr1 = 0; len1 = 0;
+                throw takeFromExternrefTable0(ret[2]);
+            }
+            deferred2_0 = ptr1;
+            deferred2_1 = len1;
+            return getStringFromWasm0(ptr1, len1);
+        } finally {
+            wasm.__wbindgen_free(deferred2_0, deferred2_1, 1);
+        }
+    }
+    /**
+     * @param {Uint32Array} starts
+     * @param {number} walks_per_vertex
+     * @param {number} walk_length
+     * @param {bigint} seed
+     * @returns {string}
+     */
+    randomWalksFrom(starts, walks_per_vertex, walk_length, seed) {
+        let deferred3_0;
+        let deferred3_1;
+        try {
+            const ptr0 = passArray32ToWasm0(starts, wasm.__wbindgen_malloc);
+            const len0 = WASM_VECTOR_LEN;
+            const ret = wasm.wasmgraph_randomWalksFrom(this.__wbg_ptr, ptr0, len0, walks_per_vertex, walk_length, seed);
+            var ptr2 = ret[0];
+            var len2 = ret[1];
+            if (ret[3]) {
+                ptr2 = 0; len2 = 0;
+                throw takeFromExternrefTable0(ret[2]);
+            }
+            deferred3_0 = ptr2;
+            deferred3_1 = len2;
+            return getStringFromWasm0(ptr2, len2);
+        } finally {
+            wasm.__wbindgen_free(deferred3_0, deferred3_1, 1);
+        }
+    }
+    /**
+     * @param {number} walks_per_vertex
+     * @param {number} walk_length
+     * @param {number} p
+     * @param {number} q
+     * @param {bigint} seed
+     * @returns {string}
+     */
+    randomWalksNode2vec(walks_per_vertex, walk_length, p, q, seed) {
+        let deferred2_0;
+        let deferred2_1;
+        try {
+            const ret = wasm.wasmgraph_randomWalksNode2vec(this.__wbg_ptr, walks_per_vertex, walk_length, p, q, seed);
+            var ptr1 = ret[0];
+            var len1 = ret[1];
+            if (ret[3]) {
+                ptr1 = 0; len1 = 0;
+                throw takeFromExternrefTable0(ret[2]);
+            }
+            deferred2_0 = ptr1;
+            deferred2_1 = len1;
+            return getStringFromWasm0(ptr1, len1);
+        } finally {
+            wasm.__wbindgen_free(deferred2_0, deferred2_1, 1);
+        }
+    }
     /**
      * @returns {string}
      */

package/wasm/igraph_wasm_bg.wasm.d.ts

@@ -309,6 +309,10 @@ export const wasmgraph_preferenceGame: (a: number, b: number, c: number, d: numb
 export const wasmgraph_radius: (a: number) => [number, number, number, number];
 export const wasmgraph_randomSpanningTree: (a: number, b: bigint) => [number, number, number, number];
 export const wasmgraph_randomWalk: (a: number, b: number, c: number, d: bigint) => [number, number, number, number];
+export const wasmgraph_randomWalkNode2vec: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
+export const wasmgraph_randomWalks: (a: number, b: number, c: number, d: bigint) => [number, number, number, number];
+export const wasmgraph_randomWalksFrom: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
+export const wasmgraph_randomWalksNode2vec: (a: number, b: number, c: number, d: number, e: number, f: bigint) => [number, number, number, number];
 export const wasmgraph_reachabilityMatrix: (a: number) => [number, number, number, number];
 export const wasmgraph_readDl: (a: number, b: number, c: number) => [number, number, number];
 export const wasmgraph_readDot: (a: number, b: number) => [number, number, number];

package/LICENSE

@@ -1,21 +0,0 @@
-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.