@graphty/algorithms 1.0.1

package/dist/test/unit/union-find.test.js

@@ -0,0 +1,245 @@
+import { describe, expect, it } from "vitest";
+import { UnionFind } from "../../src/data-structures/union-find.js";
+describe("UnionFind", () => {
+    describe("constructor", () => {
+        it("should initialize with separate components", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            expect(uf.size()).toBe(3);
+            expect(uf.getComponentCount()).toBe(3);
+            expect(uf.connected("a", "b")).toBe(false);
+            expect(uf.connected("b", "c")).toBe(false);
+            expect(uf.connected("a", "c")).toBe(false);
+        });
+        it("should handle empty initialization", () => {
+            const uf = new UnionFind([]);
+            expect(uf.size()).toBe(0);
+            expect(uf.getComponentCount()).toBe(0);
+        });
+        it("should handle single element", () => {
+            const uf = new UnionFind(["only"]);
+            expect(uf.size()).toBe(1);
+            expect(uf.getComponentCount()).toBe(1);
+            expect(uf.connected("only", "only")).toBe(true);
+        });
+    });
+    describe("find", () => {
+        it("should return the element itself initially", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            expect(uf.find("a")).toBe("a");
+            expect(uf.find("b")).toBe("b");
+            expect(uf.find("c")).toBe("c");
+        });
+        it("should throw error for non-existent element", () => {
+            const uf = new UnionFind(["a", "b"]);
+            expect(() => uf.find("nonexistent")).toThrow("Element nonexistent not found");
+        });
+        it("should implement path compression", () => {
+            const uf = new UnionFind(["a", "b", "c", "d"]);
+            // Create a chain: a -> b -> c -> d
+            uf.union("a", "b");
+            uf.union("b", "c");
+            uf.union("c", "d");
+            // After path compression, all should point to same root
+            const root = uf.find("a");
+            expect(uf.find("b")).toBe(root);
+            expect(uf.find("c")).toBe(root);
+            expect(uf.find("d")).toBe(root);
+        });
+    });
+    describe("union", () => {
+        it("should connect two separate elements", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            expect(uf.connected("a", "b")).toBe(false);
+            uf.union("a", "b");
+            expect(uf.connected("a", "b")).toBe(true);
+            expect(uf.getComponentCount()).toBe(2);
+        });
+        it("should handle union of already connected elements", () => {
+            const uf = new UnionFind(["a", "b"]);
+            uf.union("a", "b");
+            const countBefore = uf.getComponentCount();
+            uf.union("a", "b"); // Union again
+            expect(uf.getComponentCount()).toBe(countBefore);
+            expect(uf.connected("a", "b")).toBe(true);
+        });
+        it("should connect components transitively", () => {
+            const uf = new UnionFind(["a", "b", "c", "d"]);
+            uf.union("a", "b");
+            uf.union("c", "d");
+            expect(uf.getComponentCount()).toBe(2);
+            uf.union("b", "c");
+            expect(uf.getComponentCount()).toBe(1);
+            expect(uf.connected("a", "d")).toBe(true);
+        });
+        it("should use union by rank for efficiency", () => {
+            const uf = new UnionFind(["a", "b", "c", "d", "e", "f", "g", "h"]);
+            // Create two trees of different heights
+            uf.union("a", "b");
+            uf.union("a", "c");
+            uf.union("a", "d"); // Tree 1: height 2
+            uf.union("e", "f"); // Tree 2: height 1
+            // Union should attach smaller tree to larger tree's root
+            uf.union("d", "e");
+            // All elements should be connected
+            expect(uf.connected("a", "f")).toBe(true);
+            expect(uf.getComponentCount()).toBe(3); // g, h still separate
+        });
+    });
+    describe("connected", () => {
+        it("should return true for elements in same component", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            uf.union("a", "b");
+            expect(uf.connected("a", "b")).toBe(true);
+            expect(uf.connected("b", "a")).toBe(true);
+        });
+        it("should return false for elements in different components", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            uf.union("a", "b");
+            expect(uf.connected("a", "c")).toBe(false);
+            expect(uf.connected("c", "a")).toBe(false);
+        });
+        it("should return false for non-existent elements", () => {
+            const uf = new UnionFind(["a", "b"]);
+            expect(uf.connected("a", "nonexistent")).toBe(false);
+            expect(uf.connected("nonexistent", "a")).toBe(false);
+        });
+        it("should return true for element with itself", () => {
+            const uf = new UnionFind(["a"]);
+            expect(uf.connected("a", "a")).toBe(true);
+        });
+    });
+    describe("getComponent", () => {
+        it("should return all elements in the same component", () => {
+            const uf = new UnionFind(["a", "b", "c", "d"]);
+            uf.union("a", "b");
+            uf.union("b", "c");
+            const component = uf.getComponent("a");
+            expect(component).toHaveLength(3);
+            expect(component).toContain("a");
+            expect(component).toContain("b");
+            expect(component).toContain("c");
+            expect(component).not.toContain("d");
+        });
+        it("should return single element for isolated component", () => {
+            const uf = new UnionFind(["a", "b"]);
+            const component = uf.getComponent("a");
+            expect(component).toEqual(["a"]);
+        });
+    });
+    describe("getAllComponents", () => {
+        it("should return all components as separate arrays", () => {
+            const uf = new UnionFind(["a", "b", "c", "d", "e"]);
+            uf.union("a", "b");
+            uf.union("c", "d");
+            // e remains isolated
+            const components = uf.getAllComponents();
+            expect(components).toHaveLength(3);
+            // Find the components by size
+            const sizes = components.map((comp) => comp.length).sort();
+            expect(sizes).toEqual([1, 2, 2]);
+            // Check that all elements are included
+            const allElements = components.flat().sort();
+            expect(allElements).toEqual(["a", "b", "c", "d", "e"]);
+        });
+        it("should return single component when all connected", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            uf.union("a", "b");
+            uf.union("b", "c");
+            const components = uf.getAllComponents();
+            expect(components).toHaveLength(1);
+            expect(components[0]).toHaveLength(3);
+        });
+    });
+    describe("getComponentSize", () => {
+        it("should return correct size of component", () => {
+            const uf = new UnionFind(["a", "b", "c", "d"]);
+            uf.union("a", "b");
+            uf.union("b", "c");
+            expect(uf.getComponentSize("a")).toBe(3);
+            expect(uf.getComponentSize("b")).toBe(3);
+            expect(uf.getComponentSize("c")).toBe(3);
+            expect(uf.getComponentSize("d")).toBe(1);
+        });
+    });
+    describe("addElement", () => {
+        it("should add new element as separate component", () => {
+            const uf = new UnionFind(["a", "b"]);
+            expect(uf.hasElement("c")).toBe(false);
+            uf.addElement("c");
+            expect(uf.hasElement("c")).toBe(true);
+            expect(uf.size()).toBe(3);
+            expect(uf.getComponentCount()).toBe(3);
+        });
+        it("should not change anything if element already exists", () => {
+            const uf = new UnionFind(["a", "b"]);
+            const sizeBefore = uf.size();
+            const countBefore = uf.getComponentCount();
+            uf.addElement("a");
+            expect(uf.size()).toBe(sizeBefore);
+            expect(uf.getComponentCount()).toBe(countBefore);
+        });
+    });
+    describe("hasElement", () => {
+        it("should return true for existing elements", () => {
+            const uf = new UnionFind(["a", "b", "c"]);
+            expect(uf.hasElement("a")).toBe(true);
+            expect(uf.hasElement("b")).toBe(true);
+            expect(uf.hasElement("c")).toBe(true);
+        });
+        it("should return false for non-existing elements", () => {
+            const uf = new UnionFind(["a", "b"]);
+            expect(uf.hasElement("c")).toBe(false);
+            expect(uf.hasElement("nonexistent")).toBe(false);
+        });
+    });
+    describe("stress test", () => {
+        it("should handle large number of operations efficiently", () => {
+            const elements = Array.from({ length: 1000 }, (_, i) => i.toString());
+            const uf = new UnionFind(elements);
+            // Initially all separate
+            expect(uf.getComponentCount()).toBe(1000);
+            // Union adjacent elements
+            for (let i = 0; i < 999; i++) {
+                uf.union(i.toString(), (i + 1).toString());
+            }
+            // Should now have single component
+            expect(uf.getComponentCount()).toBe(1);
+            expect(uf.connected("0", "999")).toBe(true);
+            // Test multiple finds (should be fast due to path compression)
+            for (let i = 0; i < 100; i++) {
+                const randomElement = Math.floor(Math.random() * 1000).toString();
+                expect(uf.find(randomElement)).toBeDefined();
+            }
+        });
+    });
+    describe("edge cases", () => {
+        it("should handle numeric node IDs", () => {
+            const uf = new UnionFind([1, 2, 3]);
+            uf.union(1, 2);
+            expect(uf.connected(1, 2)).toBe(true);
+            expect(uf.connected(2, 3)).toBe(false);
+        });
+        it("should handle mixed string and number IDs", () => {
+            const uf = new UnionFind(["a", 1, "b", 2]);
+            uf.union("a", 1);
+            uf.union("b", 2);
+            expect(uf.connected("a", 1)).toBe(true);
+            expect(uf.connected("b", 2)).toBe(true);
+            expect(uf.connected("a", "b")).toBe(false);
+        });
+        it("should handle complex component merging", () => {
+            const uf = new UnionFind(["a", "b", "c", "d", "e", "f"]);
+            // Create two separate components
+            uf.union("a", "b");
+            uf.union("b", "c"); // Component 1: {a, b, c}
+            uf.union("d", "e");
+            uf.union("e", "f"); // Component 2: {d, e, f}
+            expect(uf.getComponentCount()).toBe(2);
+            // Merge the two components
+            uf.union("c", "d");
+            expect(uf.getComponentCount()).toBe(1);
+            expect(uf.connected("a", "f")).toBe(true);
+        });
+    });
+});
+//# sourceMappingURL=union-find.test.js.map

package/dist/test/unit/union-find.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"union-find.test.js","sourceRoot":"","sources":["../../../test/unit/union-find.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAElE,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACvB,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,EAAE,CAAC,CAAC;YAE7B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACpC,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAEnC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QAClB,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,+BAA+B,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE/C,mCAAmC;YACnC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,wDAAwD;YACxD,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACnB,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,WAAW,GAAG,EAAE,CAAC,iBAAiB,EAAE,CAAC;YAE3C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,cAAc;YAElC,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE/C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAEnE,wCAAwC;YACxC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAEvC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAEvC,yDAAyD;YACzD,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,mCAAmC;YACnC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;QAClE,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;YAChE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrD,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE/C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC3D,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACvD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAEpD,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,qBAAqB;YAErB,MAAM,UAAU,GAAG,EAAE,CAAC,gBAAgB,EAAE,CAAC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAEnC,8BAA8B;YAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAEjC,uCAAuC;YACvC,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,MAAM,UAAU,GAAG,EAAE,CAAC,gBAAgB,EAAE,CAAC;YACzC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE/C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,UAAU,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YAC7B,MAAM,WAAW,GAAG,EAAE,CAAC,iBAAiB,EAAE,CAAC;YAE3C,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACnC,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAE1C,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAErC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;YACpE,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC;YAEnC,yBAAyB;YACzB,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE1C,0BAA0B;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC/C,CAAC;YAED,mCAAmC;YACnC,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAE5C,+DAA+D;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAClE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACjD,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAEpC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAE3C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACjB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEjB,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAEzD,iCAAiC;YACjC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,yBAAyB;YAE7C,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,yBAAyB;YAE7C,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvC,2BAA2B;YAC3B,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAEnB,MAAM,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/package.json

@@ -0,0 +1,100 @@
+{
+  "name": "@graphty/algorithms",
+  "version": "1.0.1",
+  "description": "Graph algorithms library for browser environments implemented in TypeScript",
+  "author": "Adam Powers <apowers@ato.ms>",
+  "main": "dist/algorithms.js",
+  "type": "module",
+  "exports": {
+    ".": {
+      "import": "./dist/algorithms.js",
+      "types": "./dist/algorithms.d.ts"
+    }
+  },
+  "types": "dist/algorithms.d.ts",
+  "files": [
+    "dist/",
+    "src/",
+    "README.md",
+    "LICENSE"
+  ],
+  "directories": {
+    "example": "examples"
+  },
+  "scripts": {
+    "test": "vitest",
+    "test:ui": "vitest --ui",
+    "test:run": "vitest run --project=default",
+    "test:coverage": "vitest run --coverage",
+    "test:browser": "vitest --project=browser",
+    "test:all": "vitest run --project=default --project=browser",
+    "lint": "eslint && tsc --noEmit",
+    "lint:fix": "eslint --fix",
+    "lint:pkg": "knip",
+    "lint:all": "npm run lint && npm run lint:pkg",
+    "typecheck": "tsc --noEmit",
+    "prepare": "husky",
+    "build": "tsc",
+    "build:watch": "tsc --watch",
+    "dev": "tsc --watch",
+    "commit": "cz",
+    "ready:commit": "npm run build && npm run lint && npm run test:all"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/graphty-org/algorithms.git"
+  },
+  "keywords": [
+    "graph",
+    "algorithms",
+    "typescript",
+    "browser",
+    "graph-theory",
+    "network-analysis",
+    "centrality",
+    "community-detection",
+    "shortest-path",
+    "graph-traversal"
+  ],
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public",
+    "provenance": true
+  },
+  "bugs": {
+    "url": "https://github.com/graphty-org/algorithms/issues"
+  },
+  "homepage": "https://github.com/graphty-org/algorithms#readme",
+  "engines": {
+    "node": ">=18.19.0"
+  },
+  "config": {
+    "commitizen": {
+      "path": "./node_modules/cz-conventional-changelog"
+    }
+  },
+  "devDependencies": {
+    "@commitlint/cli": "^19.8.1",
+    "@commitlint/config-conventional": "^19.8.1",
+    "@eslint/js": "^9.29.0",
+    "@semantic-release/changelog": "^6.0.3",
+    "@semantic-release/git": "^10.0.1",
+    "@stylistic/eslint-plugin": "^4.4.1",
+    "@types/node": "^20.19.2",
+    "@vitest/browser": "^3.2.4",
+    "@vitest/coverage-v8": "^3.2.4",
+    "@vitest/ui": "^3.2.4",
+    "cz-conventional-changelog": "^3.3.0",
+    "eslint": "^9.29.0",
+    "eslint-plugin-simple-import-sort": "^12.1.1",
+    "globals": "^15.12.0",
+    "happy-dom": "^18.0.1",
+    "husky": "^9.1.7",
+    "knip": "^5.61.3",
+    "playwright": "^1.53.0",
+    "semantic-release": "^24.2.7",
+    "typescript": "^5.8.3",
+    "typescript-eslint": "^8.34.1",
+    "vitest": "^3.2.4"
+  }
+}

package/src/algorithms/centrality/betweenness.ts

@@ -0,0 +1,303 @@
+import type {Graph} from "../../core/graph.js";
+import type {NodeId} from "../../types/index.js";
+
+/**
+ * Betweenness centrality implementation using Brandes' algorithm
+ *
+ * Measures the extent to which a node lies on paths between other nodes.
+ * Uses the fast O(VE) algorithm by Ulrik Brandes.
+ */
+
+/**
+ * Betweenness centrality options
+ */
+export interface BetweennessCentralityOptions {
+    /**
+     * Whether to normalize the centrality values (default: false)
+     */
+    normalized?: boolean;
+    /**
+     * Whether to use endpoints in path counting (default: false)
+     */
+    endpoints?: boolean;
+}
+
+/**
+ * Calculate betweenness centrality for all nodes using Brandes' algorithm
+ */
+export function betweennessCentrality(
+    graph: Graph,
+    options: BetweennessCentralityOptions = {},
+): Record<string, number> {
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    const centrality: Record<string, number> = {};
+
+    // Initialize centrality scores
+    for (const nodeId of nodes) {
+        centrality[String(nodeId)] = 0;
+    }
+
+    // Brandes' algorithm
+    for (const source of nodes) {
+        const stack: NodeId[] = [];
+        const predecessors = new Map<NodeId, NodeId[]>();
+        const sigma = new Map<NodeId, number>(); // Number of shortest paths
+        const distance = new Map<NodeId, number>();
+        const delta = new Map<NodeId, number>();
+
+        // Initialize
+        for (const nodeId of nodes) {
+            predecessors.set(nodeId, []);
+            sigma.set(nodeId, 0);
+            distance.set(nodeId, -1);
+            delta.set(nodeId, 0);
+        }
+
+        sigma.set(source, 1);
+        distance.set(source, 0);
+
+        const queue: NodeId[] = [source];
+
+        // BFS to find shortest paths
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (!current) {
+                break;
+            }
+
+            stack.push(current);
+
+            for (const neighbor of graph.neighbors(current)) {
+                const currentDistance = distance.get(current);
+                let neighborDistance = distance.get(neighbor);
+
+                if (currentDistance === undefined || neighborDistance === undefined) {
+                    continue;
+                }
+
+                // First time we reach this neighbor
+                if (neighborDistance < 0) {
+                    queue.push(neighbor);
+                    distance.set(neighbor, currentDistance + 1);
+                    neighborDistance = currentDistance + 1; // Update local variable
+                }
+
+                // Shortest path to neighbor via current
+                if (neighborDistance === currentDistance + 1) {
+                    const neighborSigma = sigma.get(neighbor) ?? 0;
+                    const currentSigma = sigma.get(current) ?? 0;
+                    sigma.set(neighbor, neighborSigma + currentSigma);
+
+                    const preds = predecessors.get(neighbor);
+                    if (preds) {
+                        preds.push(current);
+                    }
+                }
+            }
+        }
+
+        // Accumulation - back-propagation of dependencies
+        while (stack.length > 0) {
+            const w = stack.pop();
+            if (!w) {
+                break;
+            }
+
+            const wPreds = predecessors.get(w) ?? [];
+            const wSigma = sigma.get(w) ?? 0;
+            const wDelta = delta.get(w) ?? 0;
+
+            for (const v of wPreds) {
+                const vSigma = sigma.get(v) ?? 0;
+                const vDelta = delta.get(v) ?? 0;
+
+                if (vSigma > 0 && wSigma > 0) {
+                    const contribution = (vSigma / wSigma) * (1 + wDelta);
+                    delta.set(v, vDelta + contribution);
+                }
+            }
+
+            if (w !== source) {
+                const currentCentrality = centrality[String(w)] ?? 0;
+                centrality[String(w)] = currentCentrality + wDelta;
+            }
+        }
+    }
+
+    // For undirected graphs, divide by 2 (each shortest path is counted twice)
+    if (!graph.isDirected) {
+        for (const nodeId of nodes) {
+            const key = String(nodeId);
+            const currentValue = centrality[key];
+            if (currentValue !== undefined) {
+                centrality[key] = currentValue / 2;
+            }
+        }
+    }
+
+    // Normalization
+    if (options.normalized) {
+        const n = nodes.length;
+        let normalizationFactor: number;
+
+        if (graph.isDirected) {
+            normalizationFactor = (n - 1) * (n - 2);
+        } else {
+            normalizationFactor = ((n - 1) * (n - 2)) / 2;
+        }
+
+        if (normalizationFactor > 0) {
+            for (const nodeId of nodes) {
+                const key = String(nodeId);
+                const currentValue = centrality[key];
+                if (currentValue !== undefined) {
+                    centrality[key] = currentValue / normalizationFactor;
+                }
+            }
+        }
+    }
+
+    return centrality;
+}
+
+/**
+ * Calculate betweenness centrality for a specific node
+ */
+export function nodeBetweennessCentrality(
+    graph: Graph,
+    targetNode: NodeId,
+    options: BetweennessCentralityOptions = {},
+): number {
+    if (!graph.hasNode(targetNode)) {
+        throw new Error(`Node ${String(targetNode)} not found in graph`);
+    }
+
+    const allCentralities = betweennessCentrality(graph, options);
+    return allCentralities[String(targetNode)] ?? 0;
+}
+
+/**
+ * Calculate edge betweenness centrality
+ */
+export function edgeBetweennessCentrality(
+    graph: Graph,
+    options: BetweennessCentralityOptions = {},
+): Map<string, number> {
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    const edgeCentrality = new Map<string, number>();
+
+    // Initialize edge centrality scores
+    for (const edge of graph.edges()) {
+        const edgeKey = `${String(edge.source)}-${String(edge.target)}`;
+        edgeCentrality.set(edgeKey, 0);
+    }
+
+    // Modified Brandes' algorithm for edge betweenness
+    for (const source of nodes) {
+        const stack: NodeId[] = [];
+        const predecessors = new Map<NodeId, NodeId[]>();
+        const sigma = new Map<NodeId, number>();
+        const distance = new Map<NodeId, number>();
+        const delta = new Map<NodeId, number>();
+
+        // Initialize
+        for (const nodeId of nodes) {
+            predecessors.set(nodeId, []);
+            sigma.set(nodeId, 0);
+            distance.set(nodeId, -1);
+            delta.set(nodeId, 0);
+        }
+
+        sigma.set(source, 1);
+        distance.set(source, 0);
+
+        const queue: NodeId[] = [source];
+
+        // BFS to find shortest paths
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (!current) {
+                break;
+            }
+
+            stack.push(current);
+
+            for (const neighbor of graph.neighbors(current)) {
+                const currentDistance = distance.get(current);
+                let neighborDistance = distance.get(neighbor);
+
+                if (currentDistance === undefined || neighborDistance === undefined) {
+                    continue;
+                }
+
+                if (neighborDistance < 0) {
+                    queue.push(neighbor);
+                    distance.set(neighbor, currentDistance + 1);
+                    neighborDistance = currentDistance + 1; // Update local variable
+                }
+
+                if (neighborDistance === currentDistance + 1) {
+                    const neighborSigma = sigma.get(neighbor) ?? 0;
+                    const currentSigma = sigma.get(current) ?? 0;
+                    sigma.set(neighbor, neighborSigma + currentSigma);
+
+                    const preds = predecessors.get(neighbor);
+                    if (preds) {
+                        preds.push(current);
+                    }
+                }
+            }
+        }
+
+        // Accumulation for edges
+        while (stack.length > 0) {
+            const w = stack.pop();
+            if (!w) {
+                break;
+            }
+
+            const wPreds = predecessors.get(w) ?? [];
+            const wSigma = sigma.get(w) ?? 0;
+            const wDelta = delta.get(w) ?? 0;
+
+            for (const v of wPreds) {
+                const vSigma = sigma.get(v) ?? 0;
+
+                if (vSigma > 0 && wSigma > 0) {
+                    const edgeContribution = vSigma / wSigma * (1 + wDelta);
+
+                    // Update edge centrality
+                    const edgeKey = `${String(v)}-${String(w)}`;
+                    const currentEdgeCentrality = edgeCentrality.get(edgeKey) ?? 0;
+                    edgeCentrality.set(edgeKey, currentEdgeCentrality + edgeContribution);
+
+                    // Update node delta
+                    const vDelta = delta.get(v) ?? 0;
+                    delta.set(v, vDelta + edgeContribution);
+                }
+            }
+        }
+    }
+
+    // For undirected graphs, divide by 2 (each shortest path is counted twice)
+    if (!graph.isDirected) {
+        for (const [edgeKey, centrality] of edgeCentrality) {
+            edgeCentrality.set(edgeKey, centrality / 2);
+        }
+    }
+
+    // Normalization for edges
+    if (options.normalized) {
+        const n = nodes.length;
+        const normalizationFactor = graph.isDirected ? (n - 1) * (n - 2) : ((n - 1) * (n - 2)) / 2;
+
+        if (normalizationFactor > 0) {
+            for (const [edgeKey, centrality] of edgeCentrality) {
+                edgeCentrality.set(edgeKey, centrality / normalizationFactor);
+            }
+        }
+    }
+
+    return edgeCentrality;
+}
+