@graphty/algorithms 1.2.0 → 1.4.2

package/dist/src/optimized/csr-graph.d.ts

@@ -0,0 +1,149 @@
+import type { NodeId } from "../types/index.js";
+/**
+ * Interface for read-only graph operations
+ */
+export interface ReadonlyGraph<TNodeId = NodeId> {
+    nodeCount(): number;
+    edgeCount(): number;
+    hasNode(nodeId: TNodeId): boolean;
+    hasEdge(source: TNodeId, target: TNodeId): boolean;
+    neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+    outDegree(nodeId: TNodeId): number;
+    nodes(): IterableIterator<TNodeId>;
+}
+/**
+ * Compressed Sparse Row (CSR) graph representation
+ *
+ * Provides cache-efficient graph storage with sequential memory access patterns.
+ * Optimized for traversal operations and sparse graphs.
+ */
+export declare class CSRGraph<TNodeId = NodeId> implements ReadonlyGraph<TNodeId> {
+    private data;
+    /**
+     * Creates a new CSRGraph from an adjacency list representation.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS (default true)
+     */
+    constructor(adjacencyList: Map<TNodeId, TNodeId[]>, weights?: Map<string, number>, buildReverse?: boolean);
+    /**
+     * Build CSR structure from adjacency list.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS
+     * @returns The constructed CSR graph data structure
+     */
+    private buildCSR;
+    /**
+     * Get the total number of nodes in the graph.
+     * @returns The number of nodes
+     */
+    nodeCount(): number;
+    /**
+     * Get the total number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount(): number;
+    /**
+     * Check if a node exists in the graph.
+     * @param nodeId - The node ID to check
+     * @returns True if the node exists, false otherwise
+     */
+    hasNode(nodeId: TNodeId): boolean;
+    /**
+     * Check if an edge exists between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(source: TNodeId, target: TNodeId): boolean;
+    /**
+     * Get neighbors of a node as node IDs.
+     * @param nodeId - The node ID to get neighbors for
+     * @returns An iterator over neighbor node IDs
+     */
+    neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+    /**
+     * Get all nodes in the graph.
+     * @returns An iterator over all node IDs
+     */
+    nodes(): IterableIterator<TNodeId>;
+    /**
+     * Get neighbors as indices (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns Array of neighbor indices
+     */
+    getNeighborIndices(nodeIndex: number): number[];
+    /**
+     * Get the out-degree (number of outgoing edges) of a node.
+     * @param nodeId - The node ID to get the out-degree for
+     * @returns The number of outgoing edges from the node
+     */
+    outDegree(nodeId: TNodeId): number;
+    /**
+     * Get out-degree by index (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns The number of outgoing edges from the node
+     */
+    outDegreeByIndex(nodeIndex: number): number;
+    /**
+     * Iterator support for neighbor indices.
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of neighboring nodes
+     */
+    iterateNeighborIndices(nodeIndex: number): Generator<number>;
+    /**
+     * Iterator support for incoming neighbor indices (for bottom-up BFS).
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of nodes with edges pointing to this node
+     */
+    iterateIncomingNeighborIndices(nodeIndex: number): Generator<number>;
+    /**
+     * Convert node ID to internal index.
+     * @param nodeId - The node ID to convert
+     * @returns The internal index for the node
+     */
+    nodeToIndex(nodeId: TNodeId): number;
+    /**
+     * Convert internal index to node ID.
+     * @param index - The internal index to convert
+     * @returns The node ID for the given index
+     */
+    indexToNodeId(index: number): TNodeId;
+    /**
+     * Get edge weight between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns The edge weight, or undefined if the edge doesn't exist or has no weight
+     */
+    getEdgeWeight(source: TNodeId, target: TNodeId): number | undefined;
+    /**
+     * Binary search for target in sorted array.
+     * @param arr - The typed array to search in
+     * @param target - The value to search for
+     * @param start - The starting index (inclusive)
+     * @param end - The ending index (exclusive)
+     * @returns The index of the target, or -1 if not found
+     */
+    private binarySearch;
+    /**
+     * Create CSR graph from standard Graph interface.
+     * @param graph - The graph object to convert, must implement nodes, neighbors, hasNode, and optionally getEdge
+     * @param graph.nodes - Function that returns an iterator over node objects with id property
+     * @param graph.neighbors - Function that returns an iterator over neighbor node IDs
+     * @param graph.hasNode - Function that checks if a node exists in the graph
+     * @param graph.getEdge - Optional function that returns edge data including weight
+     * @returns A new CSRGraph instance
+     */
+    static fromGraph<TNodeId = NodeId>(graph: {
+        nodes(): IterableIterator<{
+            id: TNodeId;
+        }>;
+        neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+        hasNode(nodeId: TNodeId): boolean;
+        getEdge?(source: TNodeId, target: TNodeId): {
+            weight?: number;
+        } | undefined;
+    }): CSRGraph<TNodeId>;
+}
+//# sourceMappingURL=csr-graph.d.ts.map

package/dist/src/optimized/csr-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"csr-graph.d.ts","sourceRoot":"","sources":["../../../src/optimized/csr-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,OAAO,GAAG,MAAM;IAC3C,SAAS,IAAI,MAAM,CAAC;IACpB,SAAS,IAAI,MAAM,CAAC;IACpB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;IAClC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;IACnD,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACtD,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,CAAC;IACnC,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC;CACtC;AAwBD;;;;;GAKG;AACH,qBAAa,QAAQ,CAAC,OAAO,GAAG,MAAM,CAAE,YAAW,aAAa,CAAC,OAAO,CAAC;IACrE,OAAO,CAAC,IAAI,CAAwB;IAEpC;;;;;OAKG;gBACS,aAAa,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,UAAO;IAItG;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ;IA8IhB;;;OAGG;IACH,SAAS,IAAI,MAAM;IAInB;;;OAGG;IACH,SAAS,IAAI,MAAM;IAInB;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO;IAIjC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO;IAmBlD;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC;IA2BrD;;;OAGG;IACH,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC;IAIlC;;;;OAIG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE;IAc/C;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASlC;;;;OAIG;IACH,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAU3C;;;;OAIG;IACF,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAc7D;;;;OAIG;IACF,8BAA8B,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAkBrE;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASpC;;;;OAIG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IASrC;;;;;OAKG;IACH,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IA2BnE;;;;;;;OAOG;IACH,OAAO,CAAC,YAAY;IA0BpB;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,CAAC,OAAO,GAAG,MAAM,EAAE,KAAK,EAAE;QACtC,KAAK,IAAI,gBAAgB,CAAC;YAAE,EAAE,EAAE,OAAO,CAAA;SAAE,CAAC,CAAC;QAC3C,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;QAClC,OAAO,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG;YAAE,MAAM,CAAC,EAAE,MAAM,CAAA;SAAE,GAAG,SAAS,CAAC;KAC/E,GAAG,QAAQ,CAAC,OAAO,CAAC;CAuBxB"}

package/dist/src/optimized/csr-graph.js

@@ -0,0 +1,404 @@
+/**
+ * Compressed Sparse Row (CSR) graph representation
+ *
+ * Provides cache-efficient graph storage with sequential memory access patterns.
+ * Optimized for traversal operations and sparse graphs.
+ */
+export class CSRGraph {
+    /**
+     * Creates a new CSRGraph from an adjacency list representation.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS (default true)
+     */
+    constructor(adjacencyList, weights, buildReverse = true) {
+        this.data = this.buildCSR(adjacencyList, weights, buildReverse);
+    }
+    /**
+     * Build CSR structure from adjacency list.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS
+     * @returns The constructed CSR graph data structure
+     */
+    buildCSR(adjacencyList, weights, buildReverse = true) {
+        // Collect all unique nodes (both sources and targets)
+        const allNodes = new Set();
+        for (const [source, neighbors] of adjacencyList) {
+            allNodes.add(source);
+            for (const neighbor of neighbors) {
+                allNodes.add(neighbor);
+            }
+        }
+        // Sort nodes for consistent ordering. Numeric IDs sort numerically,
+        // string IDs sort lexicographically for predictable iteration order.
+        const nodes = Array.from(allNodes).sort((a, b) => {
+            if (typeof a === "number" && typeof b === "number") {
+                return a - b;
+            }
+            return String(a).localeCompare(String(b));
+        });
+        const nodeCount = nodes.length;
+        // Build node mappings
+        const nodeIdToIndex = new Map();
+        const indexToNodeId = [];
+        nodes.forEach((nodeId, index) => {
+            nodeIdToIndex.set(nodeId, index);
+            indexToNodeId[index] = nodeId;
+        });
+        // Count total edges
+        let edgeCount = 0;
+        for (const neighbors of adjacencyList.values()) {
+            edgeCount += neighbors.length;
+        }
+        // Allocate arrays
+        const rowPointers = new Uint32Array(nodeCount + 1);
+        const columnIndices = new Uint32Array(edgeCount);
+        const edgeWeights = weights ? new Float32Array(edgeCount) : undefined;
+        // Build CSR structure
+        let currentEdge = 0;
+        for (let i = 0; i < nodeCount; i++) {
+            rowPointers[i] = currentEdge;
+            const nodeId = indexToNodeId[i];
+            if (nodeId === undefined) {
+                throw new Error(`Invalid node index ${String(i)}`);
+            }
+            const neighbors = adjacencyList.get(nodeId) ?? [];
+            // Sort neighbors for better cache locality and binary search
+            const sortedNeighbors = neighbors
+                .map((n) => {
+                const index = nodeIdToIndex.get(n);
+                if (index === undefined) {
+                    throw new Error(`Node ${String(n)} not found in nodeIdToIndex map`);
+                }
+                return { id: n, index };
+            })
+                .sort((a, b) => a.index - b.index);
+            for (const neighbor of sortedNeighbors) {
+                columnIndices[currentEdge] = neighbor.index;
+                if (edgeWeights && weights) {
+                    const edgeKey = `${String(nodeId)}-${String(neighbor.id)}`;
+                    const weight = weights.get(edgeKey);
+                    if (weight !== undefined) {
+                        edgeWeights[currentEdge] = weight;
+                    }
+                    else {
+                        edgeWeights[currentEdge] = 1;
+                    }
+                }
+                currentEdge++;
+            }
+        }
+        rowPointers[nodeCount] = currentEdge;
+        const result = {
+            rowPointers,
+            columnIndices,
+            nodeIdToIndex,
+            indexToNodeId,
+        };
+        if (edgeWeights) {
+            result.edgeWeights = edgeWeights;
+        }
+        // Build reverse edges for bottom-up BFS
+        if (buildReverse) {
+            const reverseAdjacency = new Map();
+            for (let i = 0; i < nodeCount; i++) {
+                reverseAdjacency.set(i, []);
+            }
+            // Build reverse adjacency from forward edges
+            for (let i = 0; i < nodeCount; i++) {
+                const start = rowPointers[i];
+                const end = rowPointers[i + 1];
+                if (start !== undefined && end !== undefined) {
+                    for (let j = start; j < end; j++) {
+                        const target = columnIndices[j];
+                        if (target !== undefined) {
+                            reverseAdjacency.get(target)?.push(i);
+                        }
+                    }
+                }
+            }
+            // Build reverse CSR
+            const reverseRowPointers = new Uint32Array(nodeCount + 1);
+            const reverseColumnIndices = new Uint32Array(edgeCount);
+            let reverseEdge = 0;
+            for (let i = 0; i < nodeCount; i++) {
+                reverseRowPointers[i] = reverseEdge;
+                const incoming = reverseAdjacency.get(i) ?? [];
+                incoming.sort((a, b) => a - b);
+                for (const source of incoming) {
+                    reverseColumnIndices[reverseEdge++] = source;
+                }
+            }
+            reverseRowPointers[nodeCount] = reverseEdge;
+            result.reverseRowPointers = reverseRowPointers;
+            result.reverseColumnIndices = reverseColumnIndices;
+        }
+        return result;
+    }
+    // Core API methods
+    /**
+     * Get the total number of nodes in the graph.
+     * @returns The number of nodes
+     */
+    nodeCount() {
+        return this.data.indexToNodeId.length;
+    }
+    /**
+     * Get the total number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount() {
+        return this.data.columnIndices.length;
+    }
+    /**
+     * Check if a node exists in the graph.
+     * @param nodeId - The node ID to check
+     * @returns True if the node exists, false otherwise
+     */
+    hasNode(nodeId) {
+        return this.data.nodeIdToIndex.has(nodeId);
+    }
+    /**
+     * Check if an edge exists between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(source, target) {
+        const sourceIndex = this.data.nodeIdToIndex.get(source);
+        const targetIndex = this.data.nodeIdToIndex.get(target);
+        if (sourceIndex === undefined || targetIndex === undefined) {
+            return false;
+        }
+        const start = this.data.rowPointers[sourceIndex];
+        const end = this.data.rowPointers[sourceIndex + 1];
+        // Binary search for target in sorted neighbors
+        if (start === undefined || end === undefined) {
+            return false;
+        }
+        return this.binarySearch(this.data.columnIndices, targetIndex, start, end) !== -1;
+    }
+    /**
+     * Get neighbors of a node as node IDs.
+     * @param nodeId - The node ID to get neighbors for
+     * @returns An iterator over neighbor node IDs
+     */
+    neighbors(nodeId) {
+        const nodeIndex = this.data.nodeIdToIndex.get(nodeId);
+        if (nodeIndex === undefined) {
+            return new Set().values();
+        }
+        const start = this.data.rowPointers[nodeIndex];
+        const end = this.data.rowPointers[nodeIndex + 1];
+        const { columnIndices, indexToNodeId } = this.data;
+        function* generateNeighbors() {
+            if (start !== undefined && end !== undefined) {
+                for (let i = start; i < end; i++) {
+                    const idx = columnIndices[i];
+                    if (idx !== undefined) {
+                        const nodeId = indexToNodeId[idx];
+                        if (nodeId !== undefined) {
+                            yield nodeId;
+                        }
+                    }
+                }
+            }
+        }
+        return generateNeighbors();
+    }
+    /**
+     * Get all nodes in the graph.
+     * @returns An iterator over all node IDs
+     */
+    nodes() {
+        return this.data.indexToNodeId.values();
+    }
+    /**
+     * Get neighbors as indices (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns Array of neighbor indices
+     */
+    getNeighborIndices(nodeIndex) {
+        if (nodeIndex < 0 || nodeIndex >= this.data.indexToNodeId.length) {
+            return [];
+        }
+        const start = this.data.rowPointers[nodeIndex];
+        const end = this.data.rowPointers[nodeIndex + 1];
+        if (start === undefined || end === undefined) {
+            return [];
+        }
+        return Array.from(this.data.columnIndices.subarray(start, end));
+    }
+    /**
+     * Get the out-degree (number of outgoing edges) of a node.
+     * @param nodeId - The node ID to get the out-degree for
+     * @returns The number of outgoing edges from the node
+     */
+    outDegree(nodeId) {
+        const nodeIndex = this.data.nodeIdToIndex.get(nodeId);
+        if (nodeIndex === undefined) {
+            return 0;
+        }
+        return this.outDegreeByIndex(nodeIndex);
+    }
+    /**
+     * Get out-degree by index (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns The number of outgoing edges from the node
+     */
+    outDegreeByIndex(nodeIndex) {
+        const start = this.data.rowPointers[nodeIndex];
+        const end = this.data.rowPointers[nodeIndex + 1];
+        if (start !== undefined && end !== undefined) {
+            return end - start;
+        }
+        return 0;
+    }
+    /**
+     * Iterator support for neighbor indices.
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of neighboring nodes
+     */
+    *iterateNeighborIndices(nodeIndex) {
+        const start = this.data.rowPointers[nodeIndex];
+        const end = this.data.rowPointers[nodeIndex + 1];
+        if (start !== undefined && end !== undefined) {
+            for (let i = start; i < end; i++) {
+                const value = this.data.columnIndices[i];
+                if (value !== undefined) {
+                    yield value;
+                }
+            }
+        }
+    }
+    /**
+     * Iterator support for incoming neighbor indices (for bottom-up BFS).
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of nodes with edges pointing to this node
+     */
+    *iterateIncomingNeighborIndices(nodeIndex) {
+        if (!this.data.reverseRowPointers || !this.data.reverseColumnIndices) {
+            return;
+        }
+        const start = this.data.reverseRowPointers[nodeIndex];
+        const end = this.data.reverseRowPointers[nodeIndex + 1];
+        if (start !== undefined && end !== undefined) {
+            for (let i = start; i < end; i++) {
+                const value = this.data.reverseColumnIndices[i];
+                if (value !== undefined) {
+                    yield value;
+                }
+            }
+        }
+    }
+    /**
+     * Convert node ID to internal index.
+     * @param nodeId - The node ID to convert
+     * @returns The internal index for the node
+     */
+    nodeToIndex(nodeId) {
+        const index = this.data.nodeIdToIndex.get(nodeId);
+        if (index === undefined) {
+            throw new Error(`Node ${String(nodeId)} not found in graph`);
+        }
+        return index;
+    }
+    /**
+     * Convert internal index to node ID.
+     * @param index - The internal index to convert
+     * @returns The node ID for the given index
+     */
+    indexToNodeId(index) {
+        const nodeId = this.data.indexToNodeId[index];
+        if (nodeId === undefined) {
+            throw new Error(`Index ${String(index)} out of bounds`);
+        }
+        return nodeId;
+    }
+    /**
+     * Get edge weight between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns The edge weight, or undefined if the edge doesn't exist or has no weight
+     */
+    getEdgeWeight(source, target) {
+        if (!this.data.edgeWeights) {
+            return undefined;
+        }
+        const sourceIndex = this.data.nodeIdToIndex.get(source);
+        const targetIndex = this.data.nodeIdToIndex.get(target);
+        if (sourceIndex === undefined || targetIndex === undefined) {
+            return undefined;
+        }
+        const start = this.data.rowPointers[sourceIndex];
+        const end = this.data.rowPointers[sourceIndex + 1];
+        if (start === undefined || end === undefined) {
+            return undefined;
+        }
+        const edgeIndex = this.binarySearch(this.data.columnIndices, targetIndex, start, end);
+        if (edgeIndex === -1) {
+            return undefined;
+        }
+        return this.data.edgeWeights[edgeIndex];
+    }
+    /**
+     * Binary search for target in sorted array.
+     * @param arr - The typed array to search in
+     * @param target - The value to search for
+     * @param start - The starting index (inclusive)
+     * @param end - The ending index (exclusive)
+     * @returns The index of the target, or -1 if not found
+     */
+    binarySearch(arr, target, start, end) {
+        let left = start;
+        let right = end - 1;
+        while (left <= right) {
+            const mid = (left + right) >>> 1;
+            const value = arr[mid];
+            if (value === undefined) {
+                return -1;
+            }
+            if (value === target) {
+                return mid;
+            }
+            if (value < target) {
+                left = mid + 1;
+            }
+            else {
+                right = mid - 1;
+            }
+        }
+        return -1;
+    }
+    /**
+     * Create CSR graph from standard Graph interface.
+     * @param graph - The graph object to convert, must implement nodes, neighbors, hasNode, and optionally getEdge
+     * @param graph.nodes - Function that returns an iterator over node objects with id property
+     * @param graph.neighbors - Function that returns an iterator over neighbor node IDs
+     * @param graph.hasNode - Function that checks if a node exists in the graph
+     * @param graph.getEdge - Optional function that returns edge data including weight
+     * @returns A new CSRGraph instance
+     */
+    static fromGraph(graph) {
+        const adjacencyList = new Map();
+        const weights = new Map();
+        // Build adjacency list
+        for (const node of graph.nodes()) {
+            const neighbors = [];
+            for (const neighbor of graph.neighbors(node.id)) {
+                neighbors.push(neighbor);
+                // Get edge weight if available
+                if (graph.getEdge) {
+                    const edge = graph.getEdge(node.id, neighbor);
+                    if (edge?.weight !== undefined) {
+                        weights.set(`${String(node.id)}-${String(neighbor)}`, edge.weight);
+                    }
+                }
+            }
+            adjacencyList.set(node.id, neighbors);
+        }
+        return new CSRGraph(adjacencyList, weights.size > 0 ? weights : undefined);
+    }
+}
+//# sourceMappingURL=csr-graph.js.map

package/dist/src/optimized/csr-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"csr-graph.js","sourceRoot":"","sources":["../../../src/optimized/csr-graph.ts"],"names":[],"mappings":"AAqCA;;;;;GAKG;AACH,MAAM,OAAO,QAAQ;IAGjB;;;;;OAKG;IACH,YAAY,aAAsC,EAAE,OAA6B,EAAE,YAAY,GAAG,IAAI;QAClG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;OAMG;IACK,QAAQ,CACZ,aAAsC,EACtC,OAA6B,EAC7B,YAAY,GAAG,IAAI;QAEnB,sDAAsD;QACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAW,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC/B,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QAED,oEAAoE;QACpE,qEAAqE;QACrE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7C,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACjD,OAAO,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;YAED,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/B,sBAAsB;QACtB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAmB,CAAC;QACjD,MAAM,aAAa,GAAc,EAAE,CAAC;QAEpC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YAC5B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACjC,aAAa,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,oBAAoB;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,SAAS,IAAI,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,SAAS,IAAI,SAAS,CAAC,MAAM,CAAC;QAClC,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,aAAa,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtE,sBAAsB;QACtB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,sBAAsB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvD,CAAC;YAED,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAElD,6DAA6D;YAC7D,MAAM,eAAe,GAAG,SAAS;iBAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACP,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,CAAC,CAAC,iCAAiC,CAAC,CAAC;gBACxE,CAAC;gBAED,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;YAC5B,CAAC,CAAC;iBACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAEvC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;gBACrC,aAAa,CAAC,WAAW,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAE5C,IAAI,WAAW,IAAI,OAAO,EAAE,CAAC;oBACzB,MAAM,OAAO,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;wBACvB,WAAW,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;oBACtC,CAAC;yBAAM,CAAC;wBACJ,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;oBACjC,CAAC;gBACL,CAAC;gBAED,WAAW,EAAE,CAAC;YAClB,CAAC;QACL,CAAC;QACD,WAAW,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;QAErC,MAAM,MAAM,GAA0B;YAClC,WAAW;YACX,aAAa;YACb,aAAa;YACb,aAAa;SAChB,CAAC;QAEF,IAAI,WAAW,EAAE,CAAC;YACd,MAAM,CAAC,WAAW,GAAG,WAAW,CAAC;QACrC,CAAC;QAED,wCAAwC;QACxC,IAAI,YAAY,EAAE,CAAC;YACf,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAoB,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;YAED,6CAA6C;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;wBAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;4BACvB,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC1C,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;YAED,oBAAoB;YACpB,MAAM,kBAAkB,GAAG,IAAI,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC1D,MAAM,oBAAoB,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;YAExD,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,kBAAkB,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;gBACpC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC/C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAE/B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;oBAC5B,oBAAoB,CAAC,WAAW,EAAE,CAAC,GAAG,MAAM,CAAC;gBACjD,CAAC;YACL,CAAC;YACD,kBAAkB,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;YAE5C,MAAM,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;YAC/C,MAAM,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QACvD,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,mBAAmB;IACnB;;;OAGG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,MAAe;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,MAAe,EAAE,MAAe;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAExD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAEnD,+CAA+C;QAC/C,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAe;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,IAAI,GAAG,EAAW,CAAC,MAAM,EAAE,CAAC;QACvC,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEjD,MAAM,EAAE,aAAa,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QACnD,QAAQ,CAAC,CAAC,iBAAiB;YACvB,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;oBAC7B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;wBACpB,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBAClC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;4BACvB,MAAM,MAAM,CAAC;wBACjB,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,iBAAiB,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,SAAiB;QAChC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;YAC/D,OAAO,EAAE,CAAC;QACd,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,OAAO,EAAE,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IACpE,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAe;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,CAAC,CAAC;QACb,CAAC;QAED,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,SAAiB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,OAAO,GAAG,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,OAAO,CAAC,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,CAAC,sBAAsB,CAAC,SAAiB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEjD,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACtB,MAAM,KAAK,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,CAAC,8BAA8B,CAAC,SAAiB;QAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACnE,OAAO;QACX,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAExD,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;gBAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACtB,MAAM,KAAK,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,MAAe;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;QACjE,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,KAAa;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAC5D,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,MAAe,EAAE,MAAe;QAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAExD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YACzD,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAEnD,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YAC3C,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACtF,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;YACnB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;OAOG;IACK,YAAY,CAAC,GAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,GAAW;QAC7E,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QAEpB,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACtB,OAAO,CAAC,CAAC,CAAC;YACd,CAAC;YAED,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;gBACnB,OAAO,GAAG,CAAC;YACf,CAAC;YAED,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;gBACjB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACJ,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YACpB,CAAC;QACL,CAAC;QAED,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,CAAmB,KAKlC;QACG,MAAM,aAAa,GAAG,IAAI,GAAG,EAAsB,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAc,EAAE,CAAC;YAChC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAEzB,+BAA+B;gBAC/B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBAChB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;oBAC9C,IAAI,IAAI,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;oBACvE,CAAC;gBACL,CAAC;YACL,CAAC;YACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC1C,CAAC;QAED,OAAO,IAAI,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/E,CAAC;CACJ"}

package/dist/src/optimized/direction-optimized-bfs.d.ts

@@ -0,0 +1,95 @@
+import type { NodeId } from "../types/index.js";
+import { CSRGraph } from "./csr-graph.js";
+/**
+ * Options for Direction-Optimized BFS
+ */
+export interface DirectionOptimizedBFSOptions {
+    alpha?: number;
+    beta?: number;
+}
+/**
+ * Result of BFS traversal
+ */
+export interface BFSResult<TNodeId> {
+    distances: Map<TNodeId, number>;
+    parents: Map<TNodeId, TNodeId | null>;
+    visitedCount: number;
+}
+/**
+ * Direction-Optimized Breadth-First Search
+ *
+ * Dynamically switches between top-down and bottom-up search strategies
+ * based on the size of the frontier. Particularly effective for low-diameter
+ * graphs like social networks.
+ *
+ * Based on: Beamer, S., Asanović, K., & Patterson, D. (2012).
+ * "Direction-optimizing breadth-first search." SC'12.
+ */
+export declare class DirectionOptimizedBFS<TNodeId = NodeId> {
+    private graph;
+    private alpha;
+    private beta;
+    private parent;
+    private frontier;
+    private nextFrontier;
+    private distances;
+    /**
+     * Creates a new DirectionOptimizedBFS instance.
+     * @param graph - The CSR graph to perform BFS on
+     * @param options - Optional configuration for switching thresholds
+     */
+    constructor(graph: CSRGraph<TNodeId>, options?: DirectionOptimizedBFSOptions);
+    /**
+     * Perform BFS from a single source node.
+     * @param source - The source node ID to start the BFS from
+     * @returns The BFS result containing distances and parent pointers
+     */
+    search(source: TNodeId): BFSResult<TNodeId>;
+    /**
+     * Top-down BFS step - explore from frontier.
+     * @returns The scout count (total degree of newly discovered nodes)
+     */
+    private topDownStep;
+    /**
+     * Bottom-up BFS step - check unvisited nodes for frontier neighbors.
+     * @returns The number of newly discovered nodes
+     */
+    private bottomUpStep;
+    /**
+     * Calculate edges to check for switching heuristic.
+     * @returns The total number of outgoing edges from frontier nodes
+     */
+    private calculateEdgesToCheck;
+    /**
+     * Build result map from internal data structures.
+     * @returns The BFS result containing distances and parent pointers
+     */
+    private buildResult;
+    /**
+     * Perform multi-source BFS from multiple source nodes.
+     * @param sources - Array of source node IDs to start the BFS from
+     * @returns The BFS result containing distances and parent pointers
+     */
+    searchMultiple(sources: TNodeId[]): BFSResult<TNodeId>;
+    /**
+     * Reset internal state for reuse
+     */
+    reset(): void;
+}
+/**
+ * Convenience function for single-source BFS.
+ * @param graph - The CSR graph to perform BFS on
+ * @param source - The source node ID to start the BFS from
+ * @param options - Optional configuration for switching thresholds
+ * @returns The BFS result containing distances and parent pointers
+ */
+export declare function directionOptimizedBFS<TNodeId = NodeId>(graph: CSRGraph<TNodeId>, source: TNodeId, options?: DirectionOptimizedBFSOptions): BFSResult<TNodeId>;
+/**
+ * Convenience function for multi-source BFS.
+ * @param graph - The CSR graph to perform BFS on
+ * @param sources - Array of source node IDs to start the BFS from
+ * @param options - Optional configuration for switching thresholds
+ * @returns The BFS result containing distances and parent pointers
+ */
+export declare function directionOptimizedBFSMultiple<TNodeId = NodeId>(graph: CSRGraph<TNodeId>, sources: TNodeId[], options?: DirectionOptimizedBFSOptions): BFSResult<TNodeId>;
+//# sourceMappingURL=direction-optimized-bfs.d.ts.map

package/dist/src/optimized/direction-optimized-bfs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"direction-optimized-bfs.d.ts","sourceRoot":"","sources":["../../../src/optimized/direction-optimized-bfs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C;;GAEG;AACH,MAAM,WAAW,4BAA4B;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,OAAO;IAC9B,SAAS,EAAE,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAChC,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,CAAC;IACtC,YAAY,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;GASG;AACH,qBAAa,qBAAqB,CAAC,OAAO,GAAG,MAAM;IAC/C,OAAO,CAAC,KAAK,CAAoB;IACjC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,IAAI,CAAS;IAGrB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,QAAQ,CAAc;IAC9B,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,SAAS,CAAuB;IAExC;;;;OAIG;gBACS,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,4BAA4B;IAY5E;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IAiD3C;;;OAGG;IACH,OAAO,CAAC,WAAW;IAoBnB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAwBpB;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAQ7B;;;OAGG;IACH,OAAO,CAAC,WAAW;IA4BnB;;;;OAIG;IACH,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC;IAsDtD;;OAEG;IACH,KAAK,IAAI,IAAI;CAMhB;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,GAAG,MAAM,EAClD,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,EACxB,MAAM,EAAE,OAAO,EACf,OAAO,CAAC,EAAE,4BAA4B,GACvC,SAAS,CAAC,OAAO,CAAC,CAGpB;AAED;;;;;;GAMG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,GAAG,MAAM,EAC1D,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,EACxB,OAAO,EAAE,OAAO,EAAE,EAClB,OAAO,CAAC,EAAE,4BAA4B,GACvC,SAAS,CAAC,OAAO,CAAC,CAGpB"}