@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/algorithms/shortest-path/floyd-warshall.js

@@ -1,145 +1,135 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { allPairsShortestPath } from "../../indexed/all-pairs.js";
+import { exactArcWeights } from "../../indexed/facade.js";
+import { toSnapshot } from "../../indexed/to-snapshot.js";
 /**
- * Computes all-pairs shortest paths using the Floyd-Warshall algorithm
+ * The graph without its +Infinity edges, which the port refuses and which never shortened a path
+ * (`x + Infinity < d` is false), and those edges. A NaN or -Infinity weight has no such reading, so it
+ * throws.
+ * @param graph - The legacy graph
+ * @param name - The calling function, for the error message
+ * @returns The graph to run on (the input itself when every weight is finite) and the removed edges,
+ * each in both orientations on an undirected graph
+ * @throws RangeError on a NaN or -Infinity edge weight
+ */
+function withoutInfinite(graph, name) {
+    const removed = [];
+    for (const e of graph.edges()) {
+        const w = e.weight ?? 1;
+        if (Number.isNaN(w) || w === -Infinity) {
+            throw new RangeError(`${name}: the edge ${String(e.source)} -> ${String(e.target)} has weight ${String(w)}; weights must be numbers or +Infinity (no edge)`);
+        }
+        if (w === Infinity) {
+            removed.push(e);
+        }
+    }
+    if (removed.length === 0) {
+        return { finite: graph, removed };
+    }
+    const finite = graph.clone();
+    for (const e of removed) {
+        finite.removeEdge(e.source, e.target);
+    }
+    const reversed = graph.isDirected ? [] : removed.map((e) => ({ ...e, source: e.target, target: e.source }));
+    return { finite, removed: [...removed, ...reversed] };
+}
+/**
+ * Computes all-pairs shortest paths using the Floyd-Warshall algorithm: the port's sweep in node order
+ * over the exact f64 weights, with no node bound. A self-loop never changes a node's distance to itself
+ * (0); its predecessor on the diagonal is the node. Under a negative cycle (a negative undirected edge is
+ * one) every distance is NaN and every predecessor null. An infinite edge weight counts as no edge
+ * (its predecessor entry is its source while nothing reaches the target); a NaN weight leaves its own
+ * entry NaN and shortens nothing.
  * @param graph - The graph to compute shortest paths for
  * @returns The distances, predecessors, and negative cycle detection result
+ * @throws RangeError on a NaN or -Infinity edge weight
  */
 export function floydWarshall(graph) {
-    const nodes = Array.from(graph.nodes()).map((n) => n.id);
+    const { finite, removed } = withoutInfinite(graph, "floydWarshall");
+    const s = toSnapshot(finite);
+    const { dist, n, predArc, hasNegativeCycle } = allPairsShortestPath(s, {
+        weights: exactArcWeights(s),
+        method: "floyd-warshall",
+        paths: true,
+        maxNodes: Infinity,
+    });
     const distances = new Map();
     const predecessors = new Map();
-    for (const node of nodes) {
-        distances.set(node, new Map());
-        predecessors.set(node, new Map());
-        const nodeDistances = distances.get(node);
-        const nodePredecessors = predecessors.get(node);
-        if (!nodeDistances || !nodePredecessors) {
-            continue;
-        }
-        for (const other of nodes) {
-            if (node === other) {
-                nodeDistances.set(other, 0);
-                nodePredecessors.set(other, null);
-            }
-            else {
-                nodeDistances.set(other, Infinity);
-                nodePredecessors.set(other, null);
-            }
+    for (let i = 0; i < n; i++) {
+        const row = new Map();
+        const predRow = new Map();
+        for (let j = 0; j < n; j++) {
+            const id = s.ids.idOf(j);
+            row.set(id, dist[i * n + j]);
+            const arc = predArc?.[i * n + j];
+            predRow.set(id, hasNegativeCycle || arc === undefined || i === j || dist[i * n + j] === Infinity
+                ? null
+                : s.ids.idOf(s.arcSource(arc)));
         }
+        distances.set(s.ids.idOf(i), row);
+        predecessors.set(s.ids.idOf(i), predRow);
     }
-    for (const edge of Array.from(graph.edges())) {
-        const weight = edge.weight ?? 1;
-        const sourceDistances = distances.get(edge.source);
-        const sourcePredecessors = predecessors.get(edge.source);
-        if (sourceDistances && sourcePredecessors) {
-            sourceDistances.set(edge.target, weight);
-            sourcePredecessors.set(edge.target, edge.source);
-        }
-        if (!graph.isDirected) {
-            const targetDistances = distances.get(edge.target);
-            const targetPredecessors = predecessors.get(edge.target);
-            if (targetDistances && targetPredecessors) {
-                targetDistances.set(edge.source, weight);
-                targetPredecessors.set(edge.source, edge.target);
+    if (!hasNegativeCycle) {
+        for (const e of graph.edges()) {
+            if (e.source === e.target) {
+                predecessors.get(e.source)?.set(e.source, e.source);
             }
         }
-    }
-    for (const k of nodes) {
-        for (const i of nodes) {
-            for (const j of nodes) {
-                const distancesI = distances.get(i);
-                const distancesK = distances.get(k);
-                const predecessorsI = predecessors.get(i);
-                const predecessorsK = predecessors.get(k);
-                if (!distancesI || !distancesK || !predecessorsI || !predecessorsK) {
-                    continue;
-                }
-                const distIK = distancesI.get(k);
-                const distKJ = distancesK.get(j);
-                const distIJ = distancesI.get(j);
-                if (distIK === undefined || distKJ === undefined || distIJ === undefined) {
-                    continue;
-                }
-                if (distIK + distKJ < distIJ) {
-                    distancesI.set(j, distIK + distKJ);
-                    const predKJ = predecessorsK.get(j);
-                    predecessorsI.set(j, predKJ ?? null);
-                }
+        for (const { source, target } of removed) {
+            if (distances.get(source)?.get(target) === Infinity) {
+                predecessors.get(source)?.set(target, source);
             }
         }
     }
-    let hasNegativeCycle = false;
-    for (const node of nodes) {
-        const nodeDistances = distances.get(node);
-        if (!nodeDistances) {
-            continue;
-        }
-        const selfDistance = nodeDistances.get(node);
-        if (selfDistance !== undefined && selfDistance < 0) {
-            hasNegativeCycle = true;
-            break;
-        }
-    }
-    return {
-        distances,
-        predecessors,
-        hasNegativeCycle,
-    };
+    return { distances, predecessors, hasNegativeCycle };
 }
 /**
  * Finds the shortest path between two nodes using Floyd-Warshall
  * @param graph - The graph to search
  * @param source - The starting node for the path
  * @param target - The destination node for the path
- * @returns The path and distance or null if no path exists
+ * @returns The path and distance, or null if either node is missing, no path exists, or the graph
+ * has a negative cycle
+ * @throws RangeError on a NaN or -Infinity edge weight
  */
 export function floydWarshallPath(graph, source, target) {
-    const result = floydWarshall(graph);
-    if (!graph.hasNode(source) || !graph.hasNode(target)) {
+    const s = toSnapshot(withoutInfinite(graph, "floydWarshallPath").finite);
+    const i = s.ids.indexOf(source);
+    const j = s.ids.indexOf(target);
+    if (i === INVALID_INDEX || j === INVALID_INDEX) {
         return null;
     }
-    const sourceDistances = result.distances.get(source);
-    if (!sourceDistances) {
+    const result = allPairsShortestPath(s, {
+        weights: exactArcWeights(s),
+        method: "floyd-warshall",
+        paths: true,
+        maxNodes: Infinity,
+    });
+    const distance = result.dist[i * result.n + j];
+    if (result.hasNegativeCycle || distance === Infinity) {
         return null;
     }
-    const distance = sourceDistances.get(target);
-    if (distance === undefined || distance === Infinity) {
-        return null;
-    }
-    const path = [];
-    let current = target;
-    while (current !== null && current !== source) {
-        path.unshift(current);
-        const sourcePredecessors = result.predecessors.get(source);
-        if (!sourcePredecessors) {
-            return null;
-        }
-        current = sourcePredecessors.get(current) ?? null;
-        if (path.length > graph.nodeCount) {
-            return null;
-        }
-    }
-    if (current === source) {
-        path.unshift(source);
-        return { path, distance };
-    }
-    return null;
+    return { path: Array.from(result.pathTo(i, j), (k) => s.ids.idOf(k)), distance };
 }
 /**
- * Computes the transitive closure of a graph using Floyd-Warshall
+ * Computes the transitive closure of a graph: one breadth-first search per node, edge weights
+ * ignored except that a +Infinity edge counts as no edge.
  * @param graph - The graph to compute transitive closure for
- * @returns A map of each node to the set of nodes reachable from it
+ * @returns A map of each node to the set of nodes reachable from it, itself included, in node order
+ * @throws RangeError on a NaN or -Infinity edge weight
  */
 export function transitiveClosure(graph) {
-    const result = floydWarshall(graph);
+    const s = toSnapshot(withoutInfinite(graph, "transitiveClosure").finite);
+    const { dist, n } = allPairsShortestPath(s, { weighted: false, maxNodes: Infinity });
     const closure = new Map();
-    for (const [source, distances] of Array.from(result.distances)) {
+    for (let i = 0; i < n; i++) {
         const reachable = new Set();
-        for (const [target, distance] of Array.from(distances)) {
-            if (distance < Infinity) {
-                reachable.add(target);
+        for (let j = 0; j < n; j++) {
+            if (dist[i * n + j] < Infinity) {
+                reachable.add(s.ids.idOf(j));
             }
         }
-        closure.set(source, reachable);
+        closure.set(s.ids.idOf(i), reachable);
     }
     return closure;
 }

package/dist/src/algorithms/shortest-path/floyd-warshall.js.map

@@ -1 +1 @@
-{"version":3,"file":"floyd-warshall.js","sourceRoot":"","sources":["../../../../src/algorithms/shortest-path/floyd-warshall.ts"],"names":[],"mappings":"AASA;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAY;IACtC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzD,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsC,CAAC;IAEnE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAElC,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,gBAAgB,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhD,IAAI,CAAC,aAAa,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtC,SAAS;QACb,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACjB,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC5B,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACJ,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBACnC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;IACL,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAChC,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,kBAAkB,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzD,IAAI,eAAe,IAAI,kBAAkB,EAAE,CAAC;YACxC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACzC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,kBAAkB,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEzD,IAAI,eAAe,IAAI,kBAAkB,EAAE,CAAC;gBACxC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACzC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,CAAC;QACL,CAAC;IACL,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC1C,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAE1C,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;oBACjE,SAAS;gBACb,CAAC;gBAED,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAEjC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACvE,SAAS;gBACb,CAAC;gBAED,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,CAAC;oBAC3B,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;oBACnC,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACpC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC,CAAC;gBACzC,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,IAAI,gBAAgB,GAAG,KAAK,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,SAAS;QACb,CAAC;QAED,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACjD,gBAAgB,GAAG,IAAI,CAAC;YACxB,MAAM;QACV,CAAC;IACL,CAAC;IAED,OAAO;QACH,SAAS;QACT,YAAY;QACZ,gBAAgB;KACnB,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC7B,KAAY,EACZ,MAAc,EACd,MAAc;IAEd,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAEpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACnD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,eAAe,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrD,IAAI,CAAC,eAAe,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAkB,MAAM,CAAC;IAEpC,OAAO,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QAC5C,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAEtB,MAAM,kBAAkB,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;QAElD,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAC9B,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC1C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACrD,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;gBACtB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC"}
+{"version":3,"file":"floyd-warshall.js","sourceRoot":"","sources":["../../../../src/algorithms/shortest-path/floyd-warshall.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAGtD,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAS1D;;;;;;;;;GASG;AACH,SAAS,eAAe,CAAC,KAAY,EAAE,IAAY;IAC/C,MAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;QACxB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACrC,MAAM,IAAI,UAAU,CAChB,GAAG,IAAI,cAAc,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,eAAe,MAAM,CAAC,CAAC,CAAC,kDAAkD,CACzI,CAAC;QACN,CAAC;QACD,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IACtC,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC5G,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,KAAY;IACtC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;IACpE,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAC7B,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,oBAAoB,CAAC,CAAC,EAAE;QACnE,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,gBAAgB;QACxB,KAAK,EAAE,IAAI;QACX,QAAQ,EAAE,QAAQ;KACrB,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsC,CAAC;IACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,GAAG,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,OAAO,CAAC,GAAG,CACP,EAAE,EACF,gBAAgB,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,QAAQ;gBAC5E,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CACrC,CAAC;QACN,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;gBACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,CAAC;QACL,CAAC;QACD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACvC,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAClD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAClD,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC7B,KAAY,EACZ,MAAc,EACd,MAAc;IAEd,MAAM,CAAC,GAAG,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;IACzE,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,KAAK,aAAa,IAAI,CAAC,KAAK,aAAa,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,CAAC,EAAE;QACnC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,gBAAgB;QACxB,KAAK,EAAE,IAAI;QACX,QAAQ,EAAE,QAAQ;KACrB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,IAAI,MAAM,CAAC,gBAAgB,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACnD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;AACrF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC1C,MAAM,CAAC,GAAG,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;IACzE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,oBAAoB,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;IACrF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,CAAC;gBAC7B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACL,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC"}

package/dist/src/algorithms/traversal/bfs-unified.d.ts

@@ -2,9 +2,6 @@ import type { Graph } from "../../core/graph.js";
 import type { NodeId, ShortestPathResult, TraversalOptions, TraversalResult } from "../../types/index.js";
 /**
  * Perform breadth-first search starting from a given node
- *
- * Automatically uses the most optimized implementation based on graph size.
- * No configuration needed - just call this function for the best performance.
  * @param graph - The input graph to traverse
  * @param startNode - The node to start the BFS from
  * @param options - Traversal options (callbacks, target node, etc.)
@@ -13,8 +10,6 @@ import type { NodeId, ShortestPathResult, TraversalOptions, TraversalResult } fr
 export declare function breadthFirstSearch(graph: Graph, startNode: NodeId, options?: TraversalOptions): TraversalResult;
 /**
  * Find shortest path between two nodes using BFS
- *
- * Automatically optimized for large graphs. Returns null if no path exists.
  * @param graph - The input graph to search
  * @param source - The source node ID
  * @param target - The target node ID
@@ -23,18 +18,13 @@ export declare function breadthFirstSearch(graph: Graph, startNode: NodeId, opti
 export declare function shortestPathBFS(graph: Graph, source: NodeId, target: NodeId): ShortestPathResult | null;
 /**
  * Find shortest paths from source to all reachable nodes
- *
- * Automatically optimized for large graphs.
  * @param graph - The input graph to search
  * @param source - The source node ID to compute shortest paths from
- * @returns Map of node IDs to their shortest path results
+ * @returns Map of node IDs to their shortest path results, every entry sharing one predecessor map
  */
 export declare function singleSourceShortestPathBFS(graph: Graph, source: NodeId): Map<NodeId, ShortestPathResult>;
 /**
- * Check if the graph is bipartite using BFS coloring
- *
- * Note: This function does not use Direction-Optimized BFS as the
- * coloring logic is specific and doesn't benefit from the optimization.
+ * Check if the graph is bipartite
  * @param graph - The undirected graph to check
  * @returns True if the graph is bipartite, false otherwise
  */

package/dist/src/algorithms/traversal/bfs-unified.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bfs-unified.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/traversal/bfs-unified.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AA+B1G;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,eAAe,CAYnH;AA2GD;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,kBAAkB,GAAG,IAAI,CAyBvG;AAmFD;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAYzG;AAqFD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CA0CjD"}
+{"version":3,"file":"bfs-unified.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/traversal/bfs-unified.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAKjD,OAAO,KAAK,EAAE,MAAM,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AA2B1G;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,eAAe,CAiBnH;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,kBAAkB,GAAG,IAAI,CAuBvG;AAED;;;;;GAKG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAYzG;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAKjD"}