graphwise 1.9.0 → 1.10.0

package/dist/gpu/index.cjs

@@ -1,16 +1,221 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_gpu = require("../gpu-Y6owRVMi.cjs");
-exports.GPUNotAvailableError = require_gpu.GPUNotAvailableError;
-exports.assertWebGPUAvailable = require_gpu.assertWebGPUAvailable;
-exports.csrToTypedBuffers = require_gpu.csrToTypedBuffers;
-exports.detectWebGPU = require_gpu.detectWebGPU;
-exports.gpuBfsLevels = require_gpu.gpuBfsLevels;
-exports.gpuDegreeHistogram = require_gpu.gpuDegreeHistogram;
-exports.gpuJaccardBatch = require_gpu.gpuJaccardBatch;
-exports.gpuPageRank = require_gpu.gpuPageRank;
-exports.gpuSpmv = require_gpu.gpuSpmv;
-exports.graphToCSR = require_gpu.graphToCSR;
-exports.initGPU = require_gpu.initGPU;
-exports.initGPUFromDevice = require_gpu.initGPUFromDevice;
-exports.isWebGPUAvailable = require_gpu.isWebGPUAvailable;
-exports.withBackend = require_gpu.withBackend;
+const require_typegpu = require("../typegpu-Dq5FfUB8.cjs");
+const require_logic = require("../logic-Dbyfb_-7.cjs");
+const require_operations = require("../operations-D-RB67WP.cjs");
+//#region src/gpu/csr-graph.ts
+/**
+* A ReadableGraph implementation backed by CSR arrays.
+*
+* All neighbourhood and degree queries use CSR row slices (O(1) slice + O(k) iteration
+* where k is neighbourhood size). This is significantly faster than hash map lookups
+* on large graphs, especially when the same nodes are queried multiple times.
+*
+* @typeParam N - Node data type (not stored; always returns undefined from getNode)
+* @typeParam E - Edge data type (not stored; always returns undefined from getEdge)
+*/
+var CSRReadableGraph = class CSRReadableGraph {
+	csr;
+	indexMap;
+	isDirected;
+	/**
+	* Create a CSR-backed graph from CSR structures.
+	*
+	* @param csr - CSR matrix (rowOffsets, colIndices)
+	* @param indexMap - Node ID ↔ CSR index mapping
+	* @param directed - Whether the graph is directed
+	*/
+	constructor(csr, indexMap, directed) {
+		this.csr = csr;
+		this.indexMap = indexMap;
+		this.isDirected = directed;
+	}
+	/**
+	* Create a CSR-backed graph from any ReadableGraph.
+	*
+	* Converts the graph to CSR format (O(V + E) time) and returns a
+	* CSRReadableGraph wrapping the result.
+	*
+	* @param graph - Graph to convert
+	* @param direction - Edge direction for CSR (default: 'out' for directed, 'both' for undirected)
+	* @returns CSRReadableGraph with identical topology
+	*
+	* @example
+	* ```typescript
+	* const original = AdjacencyMapGraph.undirected();
+	* // ... add nodes and edges ...
+	*
+	* const csr = CSRReadableGraph.from(original);
+	*
+	* // All operations on csr are identical to original but faster
+	* assert.deepEqual(
+	*   [...csr.neighbours('A')],
+	*   [...original.neighbours('A')]
+	* );
+	* ```
+	*/
+	static from(graph, direction = graph.directed ? "out" : "both") {
+		const nodeToIndex = /* @__PURE__ */ new Map();
+		const indexToNode = [];
+		for (const nodeId of graph.nodeIds()) {
+			const index = indexToNode.length;
+			nodeToIndex.set(nodeId, index);
+			indexToNode.push(nodeId);
+		}
+		const nodeCount = indexToNode.length;
+		const degrees = new Uint32Array(nodeCount);
+		for (const nodeId of graph.nodeIds()) {
+			const srcIndex = nodeToIndex.get(nodeId);
+			if (srcIndex === void 0) continue;
+			degrees[srcIndex] = graph.degree(nodeId, direction);
+		}
+		const rowOffsets = new Uint32Array(nodeCount + 1);
+		for (let i = 0; i < nodeCount; i++) rowOffsets[i + 1] = (rowOffsets[i] ?? 0) + (degrees[i] ?? 0);
+		const totalEdges = rowOffsets[nodeCount] ?? 0;
+		const colIndices = new Uint32Array(totalEdges);
+		for (const nodeId of graph.nodeIds()) {
+			const srcIndex = nodeToIndex.get(nodeId);
+			if (srcIndex === void 0) continue;
+			const baseOffset = rowOffsets[srcIndex] ?? 0;
+			let localOffset = 0;
+			for (const neighbourId of graph.neighbours(nodeId, direction)) {
+				const dstIndex = nodeToIndex.get(neighbourId);
+				if (dstIndex === void 0) continue;
+				colIndices[baseOffset + localOffset] = dstIndex;
+				localOffset++;
+			}
+		}
+		return new CSRReadableGraph({
+			rowOffsets,
+			colIndices,
+			nodeCount,
+			edgeCount: graph.directed ? graph.edgeCount : graph.edgeCount * 2
+		}, {
+			nodeToIndex,
+			indexToNode
+		}, graph.directed);
+	}
+	/**
+	* Access the underlying CSR matrix and index map.
+	*
+	* Useful for GPU operations that need direct CSR data.
+	*/
+	get data() {
+		return {
+			csr: this.csr,
+			indexMap: this.indexMap
+		};
+	}
+	get directed() {
+		return this.isDirected;
+	}
+	get nodeCount() {
+		return this.csr.nodeCount;
+	}
+	get edgeCount() {
+		return this.csr.edgeCount;
+	}
+	hasNode(id) {
+		return this.indexMap.nodeToIndex.has(id);
+	}
+	getNode(_id) {}
+	*nodeIds() {
+		for (const nodeId of this.indexMap.indexToNode) yield nodeId;
+	}
+	*neighbours(id, _direction) {
+		const srcIdx = this.indexMap.nodeToIndex.get(id);
+		if (srcIdx === void 0) return;
+		const { rowOffsets, colIndices } = this.csr;
+		const start = rowOffsets[srcIdx] ?? 0;
+		const end = rowOffsets[srcIdx + 1] ?? 0;
+		for (let i = start; i < end; i++) {
+			const dstIdx = colIndices[i];
+			if (dstIdx !== void 0) {
+				const nodeId = this.indexMap.indexToNode[dstIdx];
+				if (nodeId !== void 0) yield nodeId;
+			}
+		}
+	}
+	degree(id, _direction) {
+		const idx = this.indexMap.nodeToIndex.get(id);
+		if (idx === void 0) return 0;
+		const { rowOffsets } = this.csr;
+		return (rowOffsets[idx + 1] ?? 0) - (rowOffsets[idx] ?? 0);
+	}
+	getEdge(_source, _target) {}
+	*edges() {}
+};
+//#endregion
+//#region src/gpu/root.ts
+/**
+* TypeGPU root initialisation for graphwise GPU operations.
+*
+* Provides a simplified wrapper around TypeGPU's tgpu.init() for
+* GPU device acquisition and resource management.
+*
+* @module gpu/root
+*/
+/**
+* Initialise a TypeGPU root for GPU compute operations.
+*
+* This wraps tgpu.init() with WebGPU availability checking and
+* simplified options.
+*
+* @param options - Initialisation options
+* @returns Promise resolving to a TypeGPU root instance
+* @throws Error if WebGPU is unavailable or device request fails
+*
+* @example
+* ```typescript
+* import { initGPU } from "graphwise/gpu";
+*
+* const root = await initGPU();
+* // Use root for GPU operations...
+* root.destroy();
+* ```
+*/
+async function initGPU(options = {}) {
+	const detection = require_operations.detectWebGPU();
+	if (!detection.available) throw new Error(`WebGPU unavailable: ${detection.reason ?? "unknown reason"}`);
+	return await require_typegpu.tgpu_exports.init({ adapter: options.powerPreference ? { powerPreference: options.powerPreference } : void 0 });
+}
+/**
+* Create a TypeGPU root from an existing GPU device.
+*
+* Use this when you already have a GPUDevice and want to wrap it
+* with TypeGPU functionality.
+*
+* @param device - Existing GPU device
+* @returns TypeGPU root instance
+*
+* @example
+* ```typescript
+* import { initGPUFromDevice } from "graphwise/gpu";
+*
+* const adapter = await navigator.gpu.requestAdapter();
+* const device = await adapter.requestDevice();
+* const root = initGPUFromDevice(device);
+* ```
+*/
+function initGPUFromDevice(device) {
+	return require_typegpu.tgpu_exports.initFromDevice({ device });
+}
+//#endregion
+exports.CSRReadableGraph = CSRReadableGraph;
+exports.GPUNotAvailableError = require_operations.GPUNotAvailableError;
+exports.assertWebGPUAvailable = require_operations.assertWebGPUAvailable;
+exports.csrToTypedBuffers = require_logic.csrToTypedBuffers;
+exports.detectWebGPU = require_operations.detectWebGPU;
+exports.gpuBfsLevels = require_operations.gpuBfsLevels;
+exports.gpuDegreeHistogram = require_operations.gpuDegreeHistogram;
+exports.gpuJaccardBatch = require_operations.gpuJaccardBatch;
+exports.gpuKMeansAssign = require_operations.gpuKMeansAssign;
+exports.gpuMIBatch = require_operations.gpuMIBatch;
+exports.gpuPageRank = require_operations.gpuPageRank;
+exports.gpuSpmv = require_operations.gpuSpmv;
+exports.graphToCSR = require_logic.graphToCSR;
+exports.initGPU = initGPU;
+exports.initGPUFromDevice = initGPUFromDevice;
+exports.isWebGPUAvailable = require_operations.isWebGPUAvailable;
+exports.withBackend = require_operations.withBackend;
+
+//# sourceMappingURL=index.cjs.map

package/dist/gpu/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":[],"sources":["../../src/gpu/csr-graph.ts","../../src/gpu/root.ts"],"sourcesContent":["/**\n * CSR-backed read-only graph implementation.\n *\n * Provides a cache-friendly ReadableGraph backed by Compressed Sparse Row\n * arrays. Neighbourhood lookups are O(1) slices; perfect for algorithms\n * that make many repeated queries on large static graphs.\n *\n * Node and edge data are not stored (CSR is topology-only), so `getNode`\n * and `getEdge` always return undefined. For data-aware algorithms, wrap\n * in a composite that delegates data lookups to a separate store.\n */\n\nimport type { NodeId, Direction, NodeData, EdgeData } from \"../graph/types\";\nimport type { ReadableGraph } from \"../graph\";\nimport type { CSRGraph, CSRIndexMap, CSRMatrix } from \"./csr\";\n\n/**\n * A ReadableGraph implementation backed by CSR arrays.\n *\n * All neighbourhood and degree queries use CSR row slices (O(1) slice + O(k) iteration\n * where k is neighbourhood size). This is significantly faster than hash map lookups\n * on large graphs, especially when the same nodes are queried multiple times.\n *\n * @typeParam N - Node data type (not stored; always returns undefined from getNode)\n * @typeParam E - Edge data type (not stored; always returns undefined from getEdge)\n */\nexport class CSRReadableGraph<\n\tN extends NodeData = NodeData,\n\tE extends EdgeData = EdgeData,\n> implements ReadableGraph<N, E> {\n\tprivate readonly csr: CSRMatrix;\n\tprivate readonly indexMap: CSRIndexMap;\n\tprivate readonly isDirected: boolean;\n\n\t/**\n\t * Create a CSR-backed graph from CSR structures.\n\t *\n\t * @param csr - CSR matrix (rowOffsets, colIndices)\n\t * @param indexMap - Node ID ↔ CSR index mapping\n\t * @param directed - Whether the graph is directed\n\t */\n\tprivate constructor(\n\t\tcsr: CSRMatrix,\n\t\tindexMap: CSRIndexMap,\n\t\tdirected: boolean,\n\t) {\n\t\tthis.csr = csr;\n\t\tthis.indexMap = indexMap;\n\t\tthis.isDirected = directed;\n\t}\n\n\t/**\n\t * Create a CSR-backed graph from any ReadableGraph.\n\t *\n\t * Converts the graph to CSR format (O(V + E) time) and returns a\n\t * CSRReadableGraph wrapping the result.\n\t *\n\t * @param graph - Graph to convert\n\t * @param direction - Edge direction for CSR (default: 'out' for directed, 'both' for undirected)\n\t * @returns CSRReadableGraph with identical topology\n\t *\n\t * @example\n\t * ```typescript\n\t * const original = AdjacencyMapGraph.undirected();\n\t * // ... add nodes and edges ...\n\t *\n\t * const csr = CSRReadableGraph.from(original);\n\t *\n\t * // All operations on csr are identical to original but faster\n\t * assert.deepEqual(\n\t *   [...csr.neighbours('A')],\n\t *   [...original.neighbours('A')]\n\t * );\n\t * ```\n\t */\n\tstatic from<N extends NodeData, E extends EdgeData>(\n\t\tgraph: ReadableGraph<N, E>,\n\t\tdirection: Direction = graph.directed ? \"out\" : \"both\",\n\t): CSRReadableGraph<N, E> {\n\t\tconst nodeToIndex = new Map<NodeId, number>();\n\t\tconst indexToNode: NodeId[] = [];\n\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst index = indexToNode.length;\n\t\t\tnodeToIndex.set(nodeId, index);\n\t\t\tindexToNode.push(nodeId);\n\t\t}\n\n\t\tconst nodeCount = indexToNode.length;\n\n\t\t// Count edges per node\n\t\tconst degrees = new Uint32Array(nodeCount);\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst srcIndex = nodeToIndex.get(nodeId);\n\t\t\tif (srcIndex === undefined) continue;\n\t\t\tdegrees[srcIndex] = graph.degree(nodeId, direction);\n\t\t}\n\n\t\t// Build rowOffsets\n\t\tconst rowOffsets = new Uint32Array(nodeCount + 1);\n\t\tfor (let i = 0; i < nodeCount; i++) {\n\t\t\trowOffsets[i + 1] = (rowOffsets[i] ?? 0) + (degrees[i] ?? 0);\n\t\t}\n\n\t\tconst totalEdges = rowOffsets[nodeCount] ?? 0;\n\n\t\t// Build colIndices\n\t\tconst colIndices = new Uint32Array(totalEdges);\n\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst srcIndex = nodeToIndex.get(nodeId);\n\t\t\tif (srcIndex === undefined) continue;\n\n\t\t\tconst baseOffset = rowOffsets[srcIndex] ?? 0;\n\t\t\tlet localOffset = 0;\n\n\t\t\tfor (const neighbourId of graph.neighbours(nodeId, direction)) {\n\t\t\t\tconst dstIndex = nodeToIndex.get(neighbourId);\n\t\t\t\tif (dstIndex === undefined) continue;\n\n\t\t\t\tcolIndices[baseOffset + localOffset] = dstIndex;\n\t\t\t\tlocalOffset++;\n\t\t\t}\n\t\t}\n\n\t\tconst csr: CSRMatrix = {\n\t\t\trowOffsets,\n\t\t\tcolIndices,\n\t\t\tnodeCount,\n\t\t\tedgeCount: graph.directed ? graph.edgeCount : graph.edgeCount * 2,\n\t\t};\n\n\t\tconst indexMap: CSRIndexMap = {\n\t\t\tnodeToIndex,\n\t\t\tindexToNode,\n\t\t};\n\n\t\treturn new CSRReadableGraph(csr, indexMap, graph.directed);\n\t}\n\n\t/**\n\t * Access the underlying CSR matrix and index map.\n\t *\n\t * Useful for GPU operations that need direct CSR data.\n\t */\n\tget data(): CSRGraph {\n\t\treturn {\n\t\t\tcsr: this.csr,\n\t\t\tindexMap: this.indexMap,\n\t\t};\n\t}\n\n\tget directed(): boolean {\n\t\treturn this.isDirected;\n\t}\n\n\tget nodeCount(): number {\n\t\treturn this.csr.nodeCount;\n\t}\n\n\tget edgeCount(): number {\n\t\treturn this.csr.edgeCount;\n\t}\n\n\thasNode(id: NodeId): boolean {\n\t\treturn this.indexMap.nodeToIndex.has(id);\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tgetNode(_id: NodeId): undefined {\n\t\t// CSR stores topology only, no node data\n\t\treturn undefined;\n\t}\n\n\t*nodeIds(): Iterable<NodeId> {\n\t\tfor (const nodeId of this.indexMap.indexToNode) {\n\t\t\tyield nodeId;\n\t\t}\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\t*neighbours(id: NodeId, _direction?: Direction): Iterable<NodeId> {\n\t\tconst srcIdx = this.indexMap.nodeToIndex.get(id);\n\t\tif (srcIdx === undefined) return;\n\n\t\tconst { rowOffsets, colIndices } = this.csr;\n\t\tconst start = rowOffsets[srcIdx] ?? 0;\n\t\tconst end = rowOffsets[srcIdx + 1] ?? 0;\n\n\t\t// For CSR backed by 'both' direction in undirected graphs, all entries\n\t\t// are already bidirectional. Otherwise respect the direction parameter.\n\t\t// (CSR format was built with the specified direction, so we just iterate.)\n\n\t\tfor (let i = start; i < end; i++) {\n\t\t\tconst dstIdx = colIndices[i];\n\t\t\tif (dstIdx !== undefined) {\n\t\t\t\tconst nodeId = this.indexMap.indexToNode[dstIdx];\n\t\t\t\tif (nodeId !== undefined) {\n\t\t\t\t\tyield nodeId;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tdegree(id: NodeId, _direction?: Direction): number {\n\t\tconst idx = this.indexMap.nodeToIndex.get(id);\n\t\tif (idx === undefined) return 0;\n\n\t\tconst { rowOffsets } = this.csr;\n\t\treturn (rowOffsets[idx + 1] ?? 0) - (rowOffsets[idx] ?? 0);\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tgetEdge(_source: NodeId, _target: NodeId): undefined {\n\t\t// CSR stores topology only, no edge data\n\t\treturn undefined;\n\t}\n\n\t*edges(): Iterable<E> {\n\t\t// No edges can be returned because we have no edge data\n\t}\n}\n","/**\n * TypeGPU root initialisation for graphwise GPU operations.\n *\n * Provides a simplified wrapper around TypeGPU's tgpu.init() for\n * GPU device acquisition and resource management.\n *\n * @module gpu/root\n */\n\nimport { tgpu } from \"typegpu\";\nimport { detectWebGPU } from \"./detect\";\n\n/**\n * Options for initialising the GPU root.\n */\nexport interface InitGPUOptions {\n\t/** Power preference for GPU adapter */\n\treadonly powerPreference?: \"low-power\" | \"high-performance\";\n}\n\n/**\n * The TypeGPU root instance used for GPU operations.\n * Re-exports TgpuRoot from TypeGPU for convenience.\n */\nexport type GraphwiseGPURoot = Awaited<ReturnType<typeof tgpu.init>>;\n\n/**\n * Initialise a TypeGPU root for GPU compute operations.\n *\n * This wraps tgpu.init() with WebGPU availability checking and\n * simplified options.\n *\n * @param options - Initialisation options\n * @returns Promise resolving to a TypeGPU root instance\n * @throws Error if WebGPU is unavailable or device request fails\n *\n * @example\n * ```typescript\n * import { initGPU } from \"graphwise/gpu\";\n *\n * const root = await initGPU();\n * // Use root for GPU operations...\n * root.destroy();\n * ```\n */\nexport async function initGPU(\n\toptions: InitGPUOptions = {},\n): Promise<GraphwiseGPURoot> {\n\tconst detection = detectWebGPU();\n\tif (!detection.available) {\n\t\tthrow new Error(\n\t\t\t`WebGPU unavailable: ${detection.reason ?? \"unknown reason\"}`,\n\t\t);\n\t}\n\n\tconst root = await tgpu.init({\n\t\tadapter: options.powerPreference\n\t\t\t? { powerPreference: options.powerPreference }\n\t\t\t: undefined,\n\t});\n\n\treturn root;\n}\n\n/**\n * Create a TypeGPU root from an existing GPU device.\n *\n * Use this when you already have a GPUDevice and want to wrap it\n * with TypeGPU functionality.\n *\n * @param device - Existing GPU device\n * @returns TypeGPU root instance\n *\n * @example\n * ```typescript\n * import { initGPUFromDevice } from \"graphwise/gpu\";\n *\n * const adapter = await navigator.gpu.requestAdapter();\n * const device = await adapter.requestDevice();\n * const root = initGPUFromDevice(device);\n * ```\n */\nexport function initGPUFromDevice(device: GPUDevice): GraphwiseGPURoot {\n\treturn tgpu.initFromDevice({ device });\n}\n"],"mappings":";;;;;;;;;;;;;;;AA0BA,IAAa,mBAAb,MAAa,iBAGoB;CAChC;CACA;CACA;;;;;;;;CASA,YACC,KACA,UACA,UACC;AACD,OAAK,MAAM;AACX,OAAK,WAAW;AAChB,OAAK,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BnB,OAAO,KACN,OACA,YAAuB,MAAM,WAAW,QAAQ,QACvB;EACzB,MAAM,8BAAc,IAAI,KAAqB;EAC7C,MAAM,cAAwB,EAAE;AAEhC,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,QAAQ,YAAY;AAC1B,eAAY,IAAI,QAAQ,MAAM;AAC9B,eAAY,KAAK,OAAO;;EAGzB,MAAM,YAAY,YAAY;EAG9B,MAAM,UAAU,IAAI,YAAY,UAAU;AAC1C,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,WAAW,YAAY,IAAI,OAAO;AACxC,OAAI,aAAa,KAAA,EAAW;AAC5B,WAAQ,YAAY,MAAM,OAAO,QAAQ,UAAU;;EAIpD,MAAM,aAAa,IAAI,YAAY,YAAY,EAAE;AACjD,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,IAC9B,YAAW,IAAI,MAAM,WAAW,MAAM,MAAM,QAAQ,MAAM;EAG3D,MAAM,aAAa,WAAW,cAAc;EAG5C,MAAM,aAAa,IAAI,YAAY,WAAW;AAE9C,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,WAAW,YAAY,IAAI,OAAO;AACxC,OAAI,aAAa,KAAA,EAAW;GAE5B,MAAM,aAAa,WAAW,aAAa;GAC3C,IAAI,cAAc;AAElB,QAAK,MAAM,eAAe,MAAM,WAAW,QAAQ,UAAU,EAAE;IAC9D,MAAM,WAAW,YAAY,IAAI,YAAY;AAC7C,QAAI,aAAa,KAAA,EAAW;AAE5B,eAAW,aAAa,eAAe;AACvC;;;AAgBF,SAAO,IAAI,iBAZY;GACtB;GACA;GACA;GACA,WAAW,MAAM,WAAW,MAAM,YAAY,MAAM,YAAY;GAChE,EAE6B;GAC7B;GACA;GACA,EAE0C,MAAM,SAAS;;;;;;;CAQ3D,IAAI,OAAiB;AACpB,SAAO;GACN,KAAK,KAAK;GACV,UAAU,KAAK;GACf;;CAGF,IAAI,WAAoB;AACvB,SAAO,KAAK;;CAGb,IAAI,YAAoB;AACvB,SAAO,KAAK,IAAI;;CAGjB,IAAI,YAAoB;AACvB,SAAO,KAAK,IAAI;;CAGjB,QAAQ,IAAqB;AAC5B,SAAO,KAAK,SAAS,YAAY,IAAI,GAAG;;CAIzC,QAAQ,KAAwB;CAKhC,CAAC,UAA4B;AAC5B,OAAK,MAAM,UAAU,KAAK,SAAS,YAClC,OAAM;;CAKR,CAAC,WAAW,IAAY,YAA0C;EACjE,MAAM,SAAS,KAAK,SAAS,YAAY,IAAI,GAAG;AAChD,MAAI,WAAW,KAAA,EAAW;EAE1B,MAAM,EAAE,YAAY,eAAe,KAAK;EACxC,MAAM,QAAQ,WAAW,WAAW;EACpC,MAAM,MAAM,WAAW,SAAS,MAAM;AAMtC,OAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;GACjC,MAAM,SAAS,WAAW;AAC1B,OAAI,WAAW,KAAA,GAAW;IACzB,MAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAI,WAAW,KAAA,EACd,OAAM;;;;CAOV,OAAO,IAAY,YAAgC;EAClD,MAAM,MAAM,KAAK,SAAS,YAAY,IAAI,GAAG;AAC7C,MAAI,QAAQ,KAAA,EAAW,QAAO;EAE9B,MAAM,EAAE,eAAe,KAAK;AAC5B,UAAQ,WAAW,MAAM,MAAM,MAAM,WAAW,QAAQ;;CAIzD,QAAQ,SAAiB,SAA4B;CAKrD,CAAC,QAAqB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9KvB,eAAsB,QACrB,UAA0B,EAAE,EACA;CAC5B,MAAM,YAAY,mBAAA,cAAc;AAChC,KAAI,CAAC,UAAU,UACd,OAAM,IAAI,MACT,uBAAuB,UAAU,UAAU,mBAC3C;AASF,QANa,MAAM,gBAAA,aAAK,KAAK,EAC5B,SAAS,QAAQ,kBACd,EAAE,iBAAiB,QAAQ,iBAAiB,GAC5C,KAAA,GACH,CAAC;;;;;;;;;;;;;;;;;;;;AAuBH,SAAgB,kBAAkB,QAAqC;AACtE,QAAO,gBAAA,aAAK,eAAe,EAAE,QAAQ,CAAC"}

package/dist/gpu/index.d.ts

@@ -5,6 +5,7 @@
  */
 export * from './types';
 export * from './csr';
+export * from './csr-graph';
 export * from './detect';
 export * from './root';
 export * from './dispatch';

package/dist/gpu/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/gpu/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,OAAO,CAAC;AACtB,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/gpu/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,OAAO,CAAC;AACtB,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC;AACzB,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC"}

package/dist/gpu/index.js

@@ -1,2 +1,204 @@
-import { a as gpuSpmv, c as initGPUFromDevice, d as isWebGPUAvailable, f as csrToTypedBuffers, i as gpuPageRank, l as assertWebGPUAvailable, m as GPUNotAvailableError, n as gpuDegreeHistogram, o as withBackend, p as graphToCSR, r as gpuJaccardBatch, s as initGPU, t as gpuBfsLevels, u as detectWebGPU } from "../gpu-CHiCN0wa.js";
-export { GPUNotAvailableError, assertWebGPUAvailable, csrToTypedBuffers, detectWebGPU, gpuBfsLevels, gpuDegreeHistogram, gpuJaccardBatch, gpuPageRank, gpuSpmv, graphToCSR, initGPU, initGPUFromDevice, isWebGPUAvailable, withBackend };
+import { r as tgpu_exports } from "../typegpu-DwnJf28i.js";
+import { c as graphToCSR, s as csrToTypedBuffers } from "../logic-DyBzRg1A.js";
+import { a as gpuMIBatch, c as withBackend, d as detectWebGPU, f as isWebGPUAvailable, i as gpuKMeansAssign, l as GPUNotAvailableError, n as gpuDegreeHistogram, o as gpuPageRank, r as gpuJaccardBatch, s as gpuSpmv, t as gpuBfsLevels, u as assertWebGPUAvailable } from "../operations-D9otVlIH.js";
+//#region src/gpu/csr-graph.ts
+/**
+* A ReadableGraph implementation backed by CSR arrays.
+*
+* All neighbourhood and degree queries use CSR row slices (O(1) slice + O(k) iteration
+* where k is neighbourhood size). This is significantly faster than hash map lookups
+* on large graphs, especially when the same nodes are queried multiple times.
+*
+* @typeParam N - Node data type (not stored; always returns undefined from getNode)
+* @typeParam E - Edge data type (not stored; always returns undefined from getEdge)
+*/
+var CSRReadableGraph = class CSRReadableGraph {
+	csr;
+	indexMap;
+	isDirected;
+	/**
+	* Create a CSR-backed graph from CSR structures.
+	*
+	* @param csr - CSR matrix (rowOffsets, colIndices)
+	* @param indexMap - Node ID ↔ CSR index mapping
+	* @param directed - Whether the graph is directed
+	*/
+	constructor(csr, indexMap, directed) {
+		this.csr = csr;
+		this.indexMap = indexMap;
+		this.isDirected = directed;
+	}
+	/**
+	* Create a CSR-backed graph from any ReadableGraph.
+	*
+	* Converts the graph to CSR format (O(V + E) time) and returns a
+	* CSRReadableGraph wrapping the result.
+	*
+	* @param graph - Graph to convert
+	* @param direction - Edge direction for CSR (default: 'out' for directed, 'both' for undirected)
+	* @returns CSRReadableGraph with identical topology
+	*
+	* @example
+	* ```typescript
+	* const original = AdjacencyMapGraph.undirected();
+	* // ... add nodes and edges ...
+	*
+	* const csr = CSRReadableGraph.from(original);
+	*
+	* // All operations on csr are identical to original but faster
+	* assert.deepEqual(
+	*   [...csr.neighbours('A')],
+	*   [...original.neighbours('A')]
+	* );
+	* ```
+	*/
+	static from(graph, direction = graph.directed ? "out" : "both") {
+		const nodeToIndex = /* @__PURE__ */ new Map();
+		const indexToNode = [];
+		for (const nodeId of graph.nodeIds()) {
+			const index = indexToNode.length;
+			nodeToIndex.set(nodeId, index);
+			indexToNode.push(nodeId);
+		}
+		const nodeCount = indexToNode.length;
+		const degrees = new Uint32Array(nodeCount);
+		for (const nodeId of graph.nodeIds()) {
+			const srcIndex = nodeToIndex.get(nodeId);
+			if (srcIndex === void 0) continue;
+			degrees[srcIndex] = graph.degree(nodeId, direction);
+		}
+		const rowOffsets = new Uint32Array(nodeCount + 1);
+		for (let i = 0; i < nodeCount; i++) rowOffsets[i + 1] = (rowOffsets[i] ?? 0) + (degrees[i] ?? 0);
+		const totalEdges = rowOffsets[nodeCount] ?? 0;
+		const colIndices = new Uint32Array(totalEdges);
+		for (const nodeId of graph.nodeIds()) {
+			const srcIndex = nodeToIndex.get(nodeId);
+			if (srcIndex === void 0) continue;
+			const baseOffset = rowOffsets[srcIndex] ?? 0;
+			let localOffset = 0;
+			for (const neighbourId of graph.neighbours(nodeId, direction)) {
+				const dstIndex = nodeToIndex.get(neighbourId);
+				if (dstIndex === void 0) continue;
+				colIndices[baseOffset + localOffset] = dstIndex;
+				localOffset++;
+			}
+		}
+		return new CSRReadableGraph({
+			rowOffsets,
+			colIndices,
+			nodeCount,
+			edgeCount: graph.directed ? graph.edgeCount : graph.edgeCount * 2
+		}, {
+			nodeToIndex,
+			indexToNode
+		}, graph.directed);
+	}
+	/**
+	* Access the underlying CSR matrix and index map.
+	*
+	* Useful for GPU operations that need direct CSR data.
+	*/
+	get data() {
+		return {
+			csr: this.csr,
+			indexMap: this.indexMap
+		};
+	}
+	get directed() {
+		return this.isDirected;
+	}
+	get nodeCount() {
+		return this.csr.nodeCount;
+	}
+	get edgeCount() {
+		return this.csr.edgeCount;
+	}
+	hasNode(id) {
+		return this.indexMap.nodeToIndex.has(id);
+	}
+	getNode(_id) {}
+	*nodeIds() {
+		for (const nodeId of this.indexMap.indexToNode) yield nodeId;
+	}
+	*neighbours(id, _direction) {
+		const srcIdx = this.indexMap.nodeToIndex.get(id);
+		if (srcIdx === void 0) return;
+		const { rowOffsets, colIndices } = this.csr;
+		const start = rowOffsets[srcIdx] ?? 0;
+		const end = rowOffsets[srcIdx + 1] ?? 0;
+		for (let i = start; i < end; i++) {
+			const dstIdx = colIndices[i];
+			if (dstIdx !== void 0) {
+				const nodeId = this.indexMap.indexToNode[dstIdx];
+				if (nodeId !== void 0) yield nodeId;
+			}
+		}
+	}
+	degree(id, _direction) {
+		const idx = this.indexMap.nodeToIndex.get(id);
+		if (idx === void 0) return 0;
+		const { rowOffsets } = this.csr;
+		return (rowOffsets[idx + 1] ?? 0) - (rowOffsets[idx] ?? 0);
+	}
+	getEdge(_source, _target) {}
+	*edges() {}
+};
+//#endregion
+//#region src/gpu/root.ts
+/**
+* TypeGPU root initialisation for graphwise GPU operations.
+*
+* Provides a simplified wrapper around TypeGPU's tgpu.init() for
+* GPU device acquisition and resource management.
+*
+* @module gpu/root
+*/
+/**
+* Initialise a TypeGPU root for GPU compute operations.
+*
+* This wraps tgpu.init() with WebGPU availability checking and
+* simplified options.
+*
+* @param options - Initialisation options
+* @returns Promise resolving to a TypeGPU root instance
+* @throws Error if WebGPU is unavailable or device request fails
+*
+* @example
+* ```typescript
+* import { initGPU } from "graphwise/gpu";
+*
+* const root = await initGPU();
+* // Use root for GPU operations...
+* root.destroy();
+* ```
+*/
+async function initGPU(options = {}) {
+	const detection = detectWebGPU();
+	if (!detection.available) throw new Error(`WebGPU unavailable: ${detection.reason ?? "unknown reason"}`);
+	return await tgpu_exports.init({ adapter: options.powerPreference ? { powerPreference: options.powerPreference } : void 0 });
+}
+/**
+* Create a TypeGPU root from an existing GPU device.
+*
+* Use this when you already have a GPUDevice and want to wrap it
+* with TypeGPU functionality.
+*
+* @param device - Existing GPU device
+* @returns TypeGPU root instance
+*
+* @example
+* ```typescript
+* import { initGPUFromDevice } from "graphwise/gpu";
+*
+* const adapter = await navigator.gpu.requestAdapter();
+* const device = await adapter.requestDevice();
+* const root = initGPUFromDevice(device);
+* ```
+*/
+function initGPUFromDevice(device) {
+	return tgpu_exports.initFromDevice({ device });
+}
+//#endregion
+export { CSRReadableGraph, GPUNotAvailableError, assertWebGPUAvailable, csrToTypedBuffers, detectWebGPU, gpuBfsLevels, gpuDegreeHistogram, gpuJaccardBatch, gpuKMeansAssign, gpuMIBatch, gpuPageRank, gpuSpmv, graphToCSR, initGPU, initGPUFromDevice, isWebGPUAvailable, withBackend };
+
+//# sourceMappingURL=index.js.map

package/dist/gpu/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/gpu/csr-graph.ts","../../src/gpu/root.ts"],"sourcesContent":["/**\n * CSR-backed read-only graph implementation.\n *\n * Provides a cache-friendly ReadableGraph backed by Compressed Sparse Row\n * arrays. Neighbourhood lookups are O(1) slices; perfect for algorithms\n * that make many repeated queries on large static graphs.\n *\n * Node and edge data are not stored (CSR is topology-only), so `getNode`\n * and `getEdge` always return undefined. For data-aware algorithms, wrap\n * in a composite that delegates data lookups to a separate store.\n */\n\nimport type { NodeId, Direction, NodeData, EdgeData } from \"../graph/types\";\nimport type { ReadableGraph } from \"../graph\";\nimport type { CSRGraph, CSRIndexMap, CSRMatrix } from \"./csr\";\n\n/**\n * A ReadableGraph implementation backed by CSR arrays.\n *\n * All neighbourhood and degree queries use CSR row slices (O(1) slice + O(k) iteration\n * where k is neighbourhood size). This is significantly faster than hash map lookups\n * on large graphs, especially when the same nodes are queried multiple times.\n *\n * @typeParam N - Node data type (not stored; always returns undefined from getNode)\n * @typeParam E - Edge data type (not stored; always returns undefined from getEdge)\n */\nexport class CSRReadableGraph<\n\tN extends NodeData = NodeData,\n\tE extends EdgeData = EdgeData,\n> implements ReadableGraph<N, E> {\n\tprivate readonly csr: CSRMatrix;\n\tprivate readonly indexMap: CSRIndexMap;\n\tprivate readonly isDirected: boolean;\n\n\t/**\n\t * Create a CSR-backed graph from CSR structures.\n\t *\n\t * @param csr - CSR matrix (rowOffsets, colIndices)\n\t * @param indexMap - Node ID ↔ CSR index mapping\n\t * @param directed - Whether the graph is directed\n\t */\n\tprivate constructor(\n\t\tcsr: CSRMatrix,\n\t\tindexMap: CSRIndexMap,\n\t\tdirected: boolean,\n\t) {\n\t\tthis.csr = csr;\n\t\tthis.indexMap = indexMap;\n\t\tthis.isDirected = directed;\n\t}\n\n\t/**\n\t * Create a CSR-backed graph from any ReadableGraph.\n\t *\n\t * Converts the graph to CSR format (O(V + E) time) and returns a\n\t * CSRReadableGraph wrapping the result.\n\t *\n\t * @param graph - Graph to convert\n\t * @param direction - Edge direction for CSR (default: 'out' for directed, 'both' for undirected)\n\t * @returns CSRReadableGraph with identical topology\n\t *\n\t * @example\n\t * ```typescript\n\t * const original = AdjacencyMapGraph.undirected();\n\t * // ... add nodes and edges ...\n\t *\n\t * const csr = CSRReadableGraph.from(original);\n\t *\n\t * // All operations on csr are identical to original but faster\n\t * assert.deepEqual(\n\t *   [...csr.neighbours('A')],\n\t *   [...original.neighbours('A')]\n\t * );\n\t * ```\n\t */\n\tstatic from<N extends NodeData, E extends EdgeData>(\n\t\tgraph: ReadableGraph<N, E>,\n\t\tdirection: Direction = graph.directed ? \"out\" : \"both\",\n\t): CSRReadableGraph<N, E> {\n\t\tconst nodeToIndex = new Map<NodeId, number>();\n\t\tconst indexToNode: NodeId[] = [];\n\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst index = indexToNode.length;\n\t\t\tnodeToIndex.set(nodeId, index);\n\t\t\tindexToNode.push(nodeId);\n\t\t}\n\n\t\tconst nodeCount = indexToNode.length;\n\n\t\t// Count edges per node\n\t\tconst degrees = new Uint32Array(nodeCount);\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst srcIndex = nodeToIndex.get(nodeId);\n\t\t\tif (srcIndex === undefined) continue;\n\t\t\tdegrees[srcIndex] = graph.degree(nodeId, direction);\n\t\t}\n\n\t\t// Build rowOffsets\n\t\tconst rowOffsets = new Uint32Array(nodeCount + 1);\n\t\tfor (let i = 0; i < nodeCount; i++) {\n\t\t\trowOffsets[i + 1] = (rowOffsets[i] ?? 0) + (degrees[i] ?? 0);\n\t\t}\n\n\t\tconst totalEdges = rowOffsets[nodeCount] ?? 0;\n\n\t\t// Build colIndices\n\t\tconst colIndices = new Uint32Array(totalEdges);\n\n\t\tfor (const nodeId of graph.nodeIds()) {\n\t\t\tconst srcIndex = nodeToIndex.get(nodeId);\n\t\t\tif (srcIndex === undefined) continue;\n\n\t\t\tconst baseOffset = rowOffsets[srcIndex] ?? 0;\n\t\t\tlet localOffset = 0;\n\n\t\t\tfor (const neighbourId of graph.neighbours(nodeId, direction)) {\n\t\t\t\tconst dstIndex = nodeToIndex.get(neighbourId);\n\t\t\t\tif (dstIndex === undefined) continue;\n\n\t\t\t\tcolIndices[baseOffset + localOffset] = dstIndex;\n\t\t\t\tlocalOffset++;\n\t\t\t}\n\t\t}\n\n\t\tconst csr: CSRMatrix = {\n\t\t\trowOffsets,\n\t\t\tcolIndices,\n\t\t\tnodeCount,\n\t\t\tedgeCount: graph.directed ? graph.edgeCount : graph.edgeCount * 2,\n\t\t};\n\n\t\tconst indexMap: CSRIndexMap = {\n\t\t\tnodeToIndex,\n\t\t\tindexToNode,\n\t\t};\n\n\t\treturn new CSRReadableGraph(csr, indexMap, graph.directed);\n\t}\n\n\t/**\n\t * Access the underlying CSR matrix and index map.\n\t *\n\t * Useful for GPU operations that need direct CSR data.\n\t */\n\tget data(): CSRGraph {\n\t\treturn {\n\t\t\tcsr: this.csr,\n\t\t\tindexMap: this.indexMap,\n\t\t};\n\t}\n\n\tget directed(): boolean {\n\t\treturn this.isDirected;\n\t}\n\n\tget nodeCount(): number {\n\t\treturn this.csr.nodeCount;\n\t}\n\n\tget edgeCount(): number {\n\t\treturn this.csr.edgeCount;\n\t}\n\n\thasNode(id: NodeId): boolean {\n\t\treturn this.indexMap.nodeToIndex.has(id);\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tgetNode(_id: NodeId): undefined {\n\t\t// CSR stores topology only, no node data\n\t\treturn undefined;\n\t}\n\n\t*nodeIds(): Iterable<NodeId> {\n\t\tfor (const nodeId of this.indexMap.indexToNode) {\n\t\t\tyield nodeId;\n\t\t}\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\t*neighbours(id: NodeId, _direction?: Direction): Iterable<NodeId> {\n\t\tconst srcIdx = this.indexMap.nodeToIndex.get(id);\n\t\tif (srcIdx === undefined) return;\n\n\t\tconst { rowOffsets, colIndices } = this.csr;\n\t\tconst start = rowOffsets[srcIdx] ?? 0;\n\t\tconst end = rowOffsets[srcIdx + 1] ?? 0;\n\n\t\t// For CSR backed by 'both' direction in undirected graphs, all entries\n\t\t// are already bidirectional. Otherwise respect the direction parameter.\n\t\t// (CSR format was built with the specified direction, so we just iterate.)\n\n\t\tfor (let i = start; i < end; i++) {\n\t\t\tconst dstIdx = colIndices[i];\n\t\t\tif (dstIdx !== undefined) {\n\t\t\t\tconst nodeId = this.indexMap.indexToNode[dstIdx];\n\t\t\t\tif (nodeId !== undefined) {\n\t\t\t\t\tyield nodeId;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tdegree(id: NodeId, _direction?: Direction): number {\n\t\tconst idx = this.indexMap.nodeToIndex.get(id);\n\t\tif (idx === undefined) return 0;\n\n\t\tconst { rowOffsets } = this.csr;\n\t\treturn (rowOffsets[idx + 1] ?? 0) - (rowOffsets[idx] ?? 0);\n\t}\n\n\t// eslint-disable-next-line @typescript-eslint/no-unused-vars\n\tgetEdge(_source: NodeId, _target: NodeId): undefined {\n\t\t// CSR stores topology only, no edge data\n\t\treturn undefined;\n\t}\n\n\t*edges(): Iterable<E> {\n\t\t// No edges can be returned because we have no edge data\n\t}\n}\n","/**\n * TypeGPU root initialisation for graphwise GPU operations.\n *\n * Provides a simplified wrapper around TypeGPU's tgpu.init() for\n * GPU device acquisition and resource management.\n *\n * @module gpu/root\n */\n\nimport { tgpu } from \"typegpu\";\nimport { detectWebGPU } from \"./detect\";\n\n/**\n * Options for initialising the GPU root.\n */\nexport interface InitGPUOptions {\n\t/** Power preference for GPU adapter */\n\treadonly powerPreference?: \"low-power\" | \"high-performance\";\n}\n\n/**\n * The TypeGPU root instance used for GPU operations.\n * Re-exports TgpuRoot from TypeGPU for convenience.\n */\nexport type GraphwiseGPURoot = Awaited<ReturnType<typeof tgpu.init>>;\n\n/**\n * Initialise a TypeGPU root for GPU compute operations.\n *\n * This wraps tgpu.init() with WebGPU availability checking and\n * simplified options.\n *\n * @param options - Initialisation options\n * @returns Promise resolving to a TypeGPU root instance\n * @throws Error if WebGPU is unavailable or device request fails\n *\n * @example\n * ```typescript\n * import { initGPU } from \"graphwise/gpu\";\n *\n * const root = await initGPU();\n * // Use root for GPU operations...\n * root.destroy();\n * ```\n */\nexport async function initGPU(\n\toptions: InitGPUOptions = {},\n): Promise<GraphwiseGPURoot> {\n\tconst detection = detectWebGPU();\n\tif (!detection.available) {\n\t\tthrow new Error(\n\t\t\t`WebGPU unavailable: ${detection.reason ?? \"unknown reason\"}`,\n\t\t);\n\t}\n\n\tconst root = await tgpu.init({\n\t\tadapter: options.powerPreference\n\t\t\t? { powerPreference: options.powerPreference }\n\t\t\t: undefined,\n\t});\n\n\treturn root;\n}\n\n/**\n * Create a TypeGPU root from an existing GPU device.\n *\n * Use this when you already have a GPUDevice and want to wrap it\n * with TypeGPU functionality.\n *\n * @param device - Existing GPU device\n * @returns TypeGPU root instance\n *\n * @example\n * ```typescript\n * import { initGPUFromDevice } from \"graphwise/gpu\";\n *\n * const adapter = await navigator.gpu.requestAdapter();\n * const device = await adapter.requestDevice();\n * const root = initGPUFromDevice(device);\n * ```\n */\nexport function initGPUFromDevice(device: GPUDevice): GraphwiseGPURoot {\n\treturn tgpu.initFromDevice({ device });\n}\n"],"mappings":";;;;;;;;;;;;;;AA0BA,IAAa,mBAAb,MAAa,iBAGoB;CAChC;CACA;CACA;;;;;;;;CASA,YACC,KACA,UACA,UACC;AACD,OAAK,MAAM;AACX,OAAK,WAAW;AAChB,OAAK,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BnB,OAAO,KACN,OACA,YAAuB,MAAM,WAAW,QAAQ,QACvB;EACzB,MAAM,8BAAc,IAAI,KAAqB;EAC7C,MAAM,cAAwB,EAAE;AAEhC,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,QAAQ,YAAY;AAC1B,eAAY,IAAI,QAAQ,MAAM;AAC9B,eAAY,KAAK,OAAO;;EAGzB,MAAM,YAAY,YAAY;EAG9B,MAAM,UAAU,IAAI,YAAY,UAAU;AAC1C,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,WAAW,YAAY,IAAI,OAAO;AACxC,OAAI,aAAa,KAAA,EAAW;AAC5B,WAAQ,YAAY,MAAM,OAAO,QAAQ,UAAU;;EAIpD,MAAM,aAAa,IAAI,YAAY,YAAY,EAAE;AACjD,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,IAC9B,YAAW,IAAI,MAAM,WAAW,MAAM,MAAM,QAAQ,MAAM;EAG3D,MAAM,aAAa,WAAW,cAAc;EAG5C,MAAM,aAAa,IAAI,YAAY,WAAW;AAE9C,OAAK,MAAM,UAAU,MAAM,SAAS,EAAE;GACrC,MAAM,WAAW,YAAY,IAAI,OAAO;AACxC,OAAI,aAAa,KAAA,EAAW;GAE5B,MAAM,aAAa,WAAW,aAAa;GAC3C,IAAI,cAAc;AAElB,QAAK,MAAM,eAAe,MAAM,WAAW,QAAQ,UAAU,EAAE;IAC9D,MAAM,WAAW,YAAY,IAAI,YAAY;AAC7C,QAAI,aAAa,KAAA,EAAW;AAE5B,eAAW,aAAa,eAAe;AACvC;;;AAgBF,SAAO,IAAI,iBAZY;GACtB;GACA;GACA;GACA,WAAW,MAAM,WAAW,MAAM,YAAY,MAAM,YAAY;GAChE,EAE6B;GAC7B;GACA;GACA,EAE0C,MAAM,SAAS;;;;;;;CAQ3D,IAAI,OAAiB;AACpB,SAAO;GACN,KAAK,KAAK;GACV,UAAU,KAAK;GACf;;CAGF,IAAI,WAAoB;AACvB,SAAO,KAAK;;CAGb,IAAI,YAAoB;AACvB,SAAO,KAAK,IAAI;;CAGjB,IAAI,YAAoB;AACvB,SAAO,KAAK,IAAI;;CAGjB,QAAQ,IAAqB;AAC5B,SAAO,KAAK,SAAS,YAAY,IAAI,GAAG;;CAIzC,QAAQ,KAAwB;CAKhC,CAAC,UAA4B;AAC5B,OAAK,MAAM,UAAU,KAAK,SAAS,YAClC,OAAM;;CAKR,CAAC,WAAW,IAAY,YAA0C;EACjE,MAAM,SAAS,KAAK,SAAS,YAAY,IAAI,GAAG;AAChD,MAAI,WAAW,KAAA,EAAW;EAE1B,MAAM,EAAE,YAAY,eAAe,KAAK;EACxC,MAAM,QAAQ,WAAW,WAAW;EACpC,MAAM,MAAM,WAAW,SAAS,MAAM;AAMtC,OAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK;GACjC,MAAM,SAAS,WAAW;AAC1B,OAAI,WAAW,KAAA,GAAW;IACzB,MAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAI,WAAW,KAAA,EACd,OAAM;;;;CAOV,OAAO,IAAY,YAAgC;EAClD,MAAM,MAAM,KAAK,SAAS,YAAY,IAAI,GAAG;AAC7C,MAAI,QAAQ,KAAA,EAAW,QAAO;EAE9B,MAAM,EAAE,eAAe,KAAK;AAC5B,UAAQ,WAAW,MAAM,MAAM,MAAM,WAAW,QAAQ;;CAIzD,QAAQ,SAAiB,SAA4B;CAKrD,CAAC,QAAqB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9KvB,eAAsB,QACrB,UAA0B,EAAE,EACA;CAC5B,MAAM,YAAY,cAAc;AAChC,KAAI,CAAC,UAAU,UACd,OAAM,IAAI,MACT,uBAAuB,UAAU,UAAU,mBAC3C;AASF,QANa,MAAM,aAAK,KAAK,EAC5B,SAAS,QAAQ,kBACd,EAAE,iBAAiB,QAAQ,iBAAiB,GAC5C,KAAA,GACH,CAAC;;;;;;;;;;;;;;;;;;;;AAuBH,SAAgB,kBAAkB,QAAqC;AACtE,QAAO,aAAK,eAAe,EAAE,QAAQ,CAAC"}

package/dist/gpu/kernels/adamic-adar/kernel.d.ts

@@ -0,0 +1,39 @@
+import { d, StorageFlag, TgpuBuffer } from 'typegpu';
+import { TypedBufferGroup } from '../../csr';
+import { GraphwiseGPURoot } from '../../root';
+declare const AdamicLayout: import('typegpu').TgpuBindGroupLayout<{
+    rowOffsets: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    colIndices: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    pairsU: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    pairsV: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    intersections: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    sizeUs: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    sizeVs: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    results: {
+        storage: (elementCount: number) => d.WgslArray<d.F32>;
+        access: "mutable";
+    };
+    pairCount: {
+        uniform: d.U32;
+    };
+}>;
+export declare function dispatchAdamicAdar(root: GraphwiseGPURoot, csrBuffers: TypedBufferGroup, pairsU: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, pairsV: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, results: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.f32>>> & StorageFlag, intersections: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, sizeUs: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, sizeVs: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, pairCount: number): void;
+export { AdamicLayout };
+//# sourceMappingURL=kernel.d.ts.map

package/dist/gpu/kernels/adamic-adar/kernel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kernel.d.ts","sourceRoot":"","sources":["../../../../src/gpu/kernels/adamic-adar/kernel.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAa,EAAE,CAAC,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,SAAS,CAAC;AACrE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAClD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAInD,QAAA,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAUhB,CAAC;AAmFH,wBAAgB,kBAAkB,CACjC,IAAI,EAAE,gBAAgB,EACtB,UAAU,EAAE,gBAAgB,EAC5B,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,OAAO,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC7E,aAAa,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GACpE,WAAW,EACZ,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,SAAS,EAAE,MAAM,GACf,IAAI,CAeN;AAED,OAAO,EAAE,YAAY,EAAE,CAAC"}

package/dist/gpu/kernels/intersection/kernel.d.ts

@@ -0,0 +1,50 @@
+import { d, StorageFlag, TgpuBuffer } from 'typegpu';
+import { TypedBufferGroup } from '../../csr';
+import { GraphwiseGPURoot } from '../../root';
+/**
+ * Bind group layout for Intersection kernel.
+ */
+declare const IntersectionLayout: import('typegpu').TgpuBindGroupLayout<{
+    rowOffsets: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    colIndices: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    pairsU: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    pairsV: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+    };
+    intersections: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    sizeUs: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    sizeVs: {
+        storage: (elementCount: number) => d.WgslArray<d.U32>;
+        access: "mutable";
+    };
+    pairCount: {
+        uniform: d.U32;
+    };
+}>;
+/**
+ * Dispatch batch intersection on GPU.
+ *
+ * @param root - TypeGPU root instance
+ * @param csrBuffers - CSR matrix as typed buffers
+ * @param pairsU - First node of each pair (u32 array)
+ * @param pairsV - Second node of each pair (u32 array)
+ * @param intersections - Output intersections (u32 array, mutable)
+ * @param sizeUs - Output sizeU per pair (u32 array, mutable)
+ * @param sizeVs - Output sizeV per pair (u32 array, mutable)
+ * @param pairCount - Number of pairs to compute
+ */
+export declare function dispatchIntersection(root: GraphwiseGPURoot, csrBuffers: TypedBufferGroup, pairsU: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, pairsV: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, intersections: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, sizeUs: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, sizeVs: TgpuBuffer<ReturnType<typeof d.arrayOf<typeof d.u32>>> & StorageFlag, pairCount: number): void;
+export { IntersectionLayout };
+//# sourceMappingURL=kernel.d.ts.map

package/dist/gpu/kernels/intersection/kernel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kernel.d.ts","sourceRoot":"","sources":["../../../../src/gpu/kernels/intersection/kernel.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAa,EAAE,CAAC,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,SAAS,CAAC;AACrE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAClD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEnD;;GAEG;AACH,QAAA,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAStB,CAAC;AAgFH;;;;;;;;;;;GAWG;AACH,wBAAgB,oBAAoB,CACnC,IAAI,EAAE,gBAAgB,EACtB,UAAU,EAAE,gBAAgB,EAC5B,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,aAAa,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GACpE,WAAW,EACZ,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,EAC5E,SAAS,EAAE,MAAM,GACf,IAAI,CAiBN;AAED,OAAO,EAAE,kBAAkB,EAAE,CAAC"}