✨ expose graph.floydwarshall

Author: saby1101

src/graph/floyd-warshal.bench.ts

@@ -0,0 +1,46 @@
+import { buildDMUsingFloydWarshal } from "./floyd-warshal";
+
+function generateSampleData(
+  N: number,
+  edgeProb: number,
+): [number, number, number][] {
+  const edges: [number, number, number][] = [];
+
+  // For simplicity, we will just generate a random set of edges.
+  // There is no guarantee every node will be connected.
+  for (let i = 0; i < N; i++) {
+    for (let j = 0; j < N; j++) {
+      if (Math.random() < edgeProb && i !== j) {
+        // 5% probability of an edge between any two nodes.
+        const distance = Math.floor(Math.random() * 10) + 1;
+        if (distance !== 0) {
+          edges.push([i, j, distance]);
+        }
+      }
+    }
+  }
+
+  return edges;
+}
+
+const N = 300;
+const EDGE_PROB = 0.05;
+const ITERS = 100;
+const edges = generateSampleData(N, EDGE_PROB);
+
+let result: any;
+// warmup
+for (let i = 0; i < 100; i++) {
+  result = buildDMUsingFloydWarshal(N, edges);
+}
+const start = Date.now();
+for (let i = 0; i < ITERS; i++) {
+  result = buildDMUsingFloydWarshal(N, edges);
+}
+const end = Date.now();
+console.log(
+  "Benchmarking buildDMUsingFloydWarshal",
+  (end - start) / ITERS,
+  "ms",
+);
+console.log(result.length);

src/graph/floyd-warshal.ts

@@ -26,7 +26,7 @@ export function buildDAGTransitiveClosure<T>(
 export function buildDMUsingFloydWarshal(
   N: number,
   edges: [number, number, number][],
-) {
+): number[][] {
   const dm: number[][] = [];
   for (let i = 0; i < N; i++) {
     const row: number[] = [];

src/graph/index.ts

@@ -1,4 +1,8 @@
-export { buildDAGTransitiveClosure } from "./floyd-warshal";
+export {
+  buildDAGTransitiveClosure,
+  buildDMUsingFloydWarshal,
+  buildClosureFromDM,
+} from "./floyd-warshal";
 export { Edge, TransitiveClosure } from "./interfaces";
 export { isThereCycleInDG } from "./detect-cycle";
 export { topoSort } from "./topo-sort";