@graphty/algorithms 1.0.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 Adam Powers
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,193 @@
+# @graphty/algorithms
+
+A comprehensive TypeScript graph algorithms library optimized for browser environments and visualization applications.
+
+## Features
+
+- **TypeScript-first**: Full type safety with comprehensive type definitions
+- **Browser-optimized**: Designed to run efficiently in web browsers
+- **Modular**: Import only the algorithms you need
+- **Comprehensive**: Implements essential graph algorithms for analysis and visualization
+- **Well-tested**: Extensive test suite with high coverage
+- **Standards-compliant**: Follows conventional commits and semantic versioning
+
+## Installation
+
+```bash
+npm install @graphty/algorithms
+```
+
+## Quick Start
+
+```typescript
+import { Graph } from '@graphty/algorithms';
+
+// Create a new graph
+const graph = new Graph();
+
+// Add nodes and edges
+graph.addNode('A');
+graph.addNode('B');
+graph.addEdge('A', 'B', 1); // source, target, weight
+
+// Basic graph operations
+console.log(graph.nodeCount); // 2
+console.log(graph.totalEdgeCount); // 1
+console.log(graph.hasEdge('A', 'B')); // true
+```
+
+## Algorithms (Planned)
+
+### Priority 1: Essential Algorithms
+
+#### Graph Traversal
+- [x] **Graph Data Structure**: Core graph implementation with adjacency lists
+- [ ] **Breadth-First Search (BFS)**: Level-by-level traversal and shortest paths
+- [ ] **Depth-First Search (DFS)**: Deep traversal with cycle detection
+
+#### Shortest Path
+- [ ] **Dijkstra's Algorithm**: Single-source shortest paths for weighted graphs
+- [ ] **Bellman-Ford Algorithm**: Shortest paths with negative edge weights
+
+#### Centrality Measures
+- [ ] **Degree Centrality**: Node importance based on connections
+- [ ] **Betweenness Centrality**: Node importance based on shortest path frequency
+- [ ] **Closeness Centrality**: Node importance based on average distance
+- [ ] **PageRank**: Google's web page ranking algorithm
+
+#### Community Detection
+- [ ] **Louvain Algorithm**: Fast modularity-based community detection
+- [ ] **Girvan-Newman Algorithm**: Hierarchical community detection
+
+#### Connected Components
+- [ ] **Connected Components**: Find connected subgraphs
+- [ ] **Strongly Connected Components**: Tarjan's algorithm for directed graphs
+
+## API Reference
+
+### Graph Class
+
+```typescript
+class Graph {
+  constructor(config?: Partial<GraphConfig>)
+  
+  // Node operations
+  addNode(id: NodeId, data?: Record<string, unknown>): void
+  removeNode(id: NodeId): boolean
+  hasNode(id: NodeId): boolean
+  getNode(id: NodeId): Node | undefined
+  
+  // Edge operations
+  addEdge(source: NodeId, target: NodeId, weight?: number, data?: Record<string, unknown>): void
+  removeEdge(source: NodeId, target: NodeId): boolean
+  hasEdge(source: NodeId, target: NodeId): boolean
+  getEdge(source: NodeId, target: NodeId): Edge | undefined
+  
+  // Graph properties
+  get nodeCount(): number
+  get totalEdgeCount(): number
+  get isDirected(): boolean
+  
+  // Degree calculations
+  degree(nodeId: NodeId): number
+  inDegree(nodeId: NodeId): number
+  outDegree(nodeId: NodeId): number
+  
+  // Iteration
+  nodes(): IterableIterator<Node>
+  edges(): IterableIterator<Edge>
+  neighbors(nodeId: NodeId): IterableIterator<NodeId>
+  
+  // Utilities
+  clone(): Graph
+}
+```
+
+## Development
+
+### Prerequisites
+
+- Node.js 18+ 
+- npm 9+
+
+### Setup
+
+```bash
+# Clone the repository
+git clone https://github.com/graphty-org/algorithms.git
+cd algorithms
+
+# Install dependencies
+npm install
+
+# Set up git hooks
+npm run prepare
+```
+
+### Scripts
+
+```bash
+# Development
+npm run dev          # Watch mode compilation
+npm run build        # Build the library
+npm run typecheck    # Type checking
+
+# Testing
+npm run test         # Run tests in watch mode
+npm run test:run     # Run tests once
+npm run test:coverage # Generate coverage report
+npm run test:browser # Run browser tests
+
+# Code Quality
+npm run lint         # Run ESLint
+npm run lint:fix     # Fix ESLint issues
+npm run lint:pkg     # Check for unused dependencies
+
+# Git
+npm run commit       # Conventional commit helper
+```
+
+### Project Structure
+
+```
+src/
+├── core/              # Core graph data structures
+├── algorithms/        # Algorithm implementations
+│   ├── traversal/     # BFS, DFS
+│   ├── shortest-path/ # Dijkstra, Bellman-Ford
+│   ├── centrality/    # Degree, Betweenness, PageRank
+│   ├── community/     # Louvain, Girvan-Newman
+│   └── components/    # Connected components
+├── data-structures/   # Supporting data structures
+├── types/            # TypeScript type definitions
+└── utils/            # Utility functions
+
+test/
+├── unit/             # Unit tests
+├── browser/          # Browser-specific tests
+└── helpers/          # Test utilities
+```
+
+## Contributing
+
+We welcome contributions! Please see our [Contributing Guide](CONTRIBUTING.md) for details.
+
+### Commit Convention
+
+This project uses [Conventional Commits](https://www.conventionalcommits.org/):
+
+```
+feat(scope): add new algorithm
+fix(scope): resolve edge case in traversal
+docs(scope): update API documentation
+test(scope): add coverage for centrality measures
+```
+
+## License
+
+MIT © Adam Powers
+
+## Related Projects
+
+- [@graphty/layout](https://github.com/graphty-org/layout) - Graph layout algorithms
+- [@graphty/graphty-element](https://github.com/graphty-org/graphty-element) - 3D graph visualization web component

package/dist/src/algorithms/centrality/betweenness.d.ts

@@ -0,0 +1,34 @@
+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 declare function betweennessCentrality(graph: Graph, options?: BetweennessCentralityOptions): Record<string, number>;
+/**
+ * Calculate betweenness centrality for a specific node
+ */
+export declare function nodeBetweennessCentrality(graph: Graph, targetNode: NodeId, options?: BetweennessCentralityOptions): number;
+/**
+ * Calculate edge betweenness centrality
+ */
+export declare function edgeBetweennessCentrality(graph: Graph, options?: BetweennessCentralityOptions): Map<string, number>;
+//# sourceMappingURL=betweenness.d.ts.map

package/dist/src/algorithms/centrality/betweenness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"betweenness.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/centrality/betweenness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAEjD;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,WAAW,4BAA4B;IACzC;;OAEG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;OAEG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACjC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,4BAAiC,GAC3C,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAkIxB;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACrC,KAAK,EAAE,KAAK,EACZ,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,4BAAiC,GAC3C,MAAM,CAOR;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACrC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,4BAAiC,GAC3C,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAqHrB"}

package/dist/src/algorithms/centrality/betweenness.js

@@ -0,0 +1,223 @@
+/**
+ * Calculate betweenness centrality for all nodes using Brandes' algorithm
+ */
+export function betweennessCentrality(graph, options = {}) {
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    const centrality = {};
+    // Initialize centrality scores
+    for (const nodeId of nodes) {
+        centrality[String(nodeId)] = 0;
+    }
+    // Brandes' algorithm
+    for (const source of nodes) {
+        const stack = [];
+        const predecessors = new Map();
+        const sigma = new Map(); // Number of shortest paths
+        const distance = new Map();
+        const delta = new Map();
+        // 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 = [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;
+        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, targetNode, options = {}) {
+    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, options = {}) {
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    const edgeCentrality = new Map();
+    // 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 = [];
+        const predecessors = new Map();
+        const sigma = new Map();
+        const distance = new Map();
+        const delta = new Map();
+        // 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 = [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;
+}
+//# sourceMappingURL=betweenness.js.map

package/dist/src/algorithms/centrality/betweenness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"betweenness.js","sourceRoot":"","sources":["../../../../src/algorithms/centrality/betweenness.ts"],"names":[],"mappings":"AAwBA;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACjC,KAAY,EACZ,UAAwC,EAAE;IAE1C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/D,MAAM,UAAU,GAA2B,EAAE,CAAC;IAE9C,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,qBAAqB;IACrB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,2BAA2B;QACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAExC,aAAa;QACb,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC7B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAExB,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QAEjC,6BAA6B;QAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,MAAM;YACV,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEpB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9C,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC9C,IAAI,gBAAgB,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAE9C,IAAI,eAAe,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;oBAClE,SAAS;gBACb,CAAC;gBAED,oCAAoC;gBACpC,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;oBAC5C,gBAAgB,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,wBAAwB;gBACpE,CAAC;gBAED,wCAAwC;gBACxC,IAAI,gBAAgB,KAAK,eAAe,GAAG,CAAC,EAAE,CAAC;oBAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;oBAC/C,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC7C,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,GAAG,YAAY,CAAC,CAAC;oBAElD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACzC,IAAI,KAAK,EAAE,CAAC;wBACR,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACxB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,kDAAkD;QAClD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,EAAE,CAAC;gBACL,MAAM;YACV,CAAC;YAED,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAEjC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACrB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAEjC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,YAAY,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;oBACtD,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC;gBACxC,CAAC;YACL,CAAC;YAED,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;gBACf,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACrD,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,iBAAiB,GAAG,MAAM,CAAC;YACvD,CAAC;QACL,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC7B,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YACvC,CAAC;QACL,CAAC;IACL,CAAC;IAED,gBAAgB;IAChB,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,IAAI,mBAA2B,CAAC;QAEhC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACnB,mBAAmB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACJ,mBAAmB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,mBAAmB,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3B,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAC7B,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,GAAG,mBAAmB,CAAC;gBACzD,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACrC,KAAY,EACZ,UAAkB,EAClB,UAAwC,EAAE;IAE1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,UAAU,CAAC,qBAAqB,CAAC,CAAC;IACrE,CAAC;IAED,MAAM,eAAe,GAAG,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9D,OAAO,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACrC,KAAY,EACZ,UAAwC,EAAE;IAE1C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,oCAAoC;IACpC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAChE,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,mDAAmD;IACnD,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAExC,aAAa;QACb,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC7B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAExB,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QAEjC,6BAA6B;QAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,MAAM;YACV,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEpB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9C,MAAM,eAAe,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC9C,IAAI,gBAAgB,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAE9C,IAAI,eAAe,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;oBAClE,SAAS;gBACb,CAAC;gBAED,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;oBAC5C,gBAAgB,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,wBAAwB;gBACpE,CAAC;gBAED,IAAI,gBAAgB,KAAK,eAAe,GAAG,CAAC,EAAE,CAAC;oBAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;oBAC/C,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC7C,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,GAAG,YAAY,CAAC,CAAC;oBAElD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACzC,IAAI,KAAK,EAAE,CAAC;wBACR,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACxB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,yBAAyB;QACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,EAAE,CAAC;gBACL,MAAM;YACV,CAAC;YAED,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAEjC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACrB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAEjC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,gBAAgB,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;oBAExD,yBAAyB;oBACzB,MAAM,OAAO,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5C,MAAM,qBAAqB,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC/D,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,qBAAqB,GAAG,gBAAgB,CAAC,CAAC;oBAEtE,oBAAoB;oBACpB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACjC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAAC,CAAC;gBAC5C,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,cAAc,EAAE,CAAC;YACjD,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACL,CAAC;IAED,0BAA0B;IAC1B,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,mBAAmB,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE3F,IAAI,mBAAmB,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,cAAc,EAAE,CAAC;gBACjD,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,GAAG,mBAAmB,CAAC,CAAC;YAClE,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,cAAc,CAAC;AAC1B,CAAC"}

package/dist/src/algorithms/centrality/closeness.d.ts

@@ -0,0 +1,43 @@
+import type { Graph } from "../../core/graph.js";
+import type { NodeId } from "../../types/index.js";
+/**
+ * Closeness centrality implementation
+ *
+ * Measures how close a node is to all other nodes in the graph.
+ * Uses BFS to compute shortest path distances efficiently.
+ */
+/**
+ * Closeness centrality options
+ */
+export interface ClosenessCentralityOptions {
+    /**
+     * Whether to normalize the centrality values (default: false)
+     */
+    normalized?: boolean;
+    /**
+     * Use harmonic mean instead of reciprocal of sum (default: false)
+     * Better for disconnected graphs
+     */
+    harmonic?: boolean;
+    /**
+     * Consider only nodes within this distance (default: undefined = all nodes)
+     */
+    cutoff?: number;
+}
+/**
+ * Calculate closeness centrality for all nodes
+ */
+export declare function closenessCentrality(graph: Graph, options?: ClosenessCentralityOptions): Record<string, number>;
+/**
+ * Calculate closeness centrality for a specific node
+ */
+export declare function nodeClosenessCentrality(graph: Graph, node: NodeId, options?: ClosenessCentralityOptions): number;
+/**
+ * Calculate weighted closeness centrality using Dijkstra's algorithm
+ */
+export declare function weightedClosenessCentrality(graph: Graph, options?: ClosenessCentralityOptions): Record<string, number>;
+/**
+ * Calculate weighted closeness centrality for a specific node using Dijkstra
+ */
+export declare function nodeWeightedClosenessCentrality(graph: Graph, node: NodeId, options?: ClosenessCentralityOptions): number;
+//# sourceMappingURL=closeness.d.ts.map

package/dist/src/algorithms/centrality/closeness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"closeness.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/centrality/closeness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAEjD;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,WAAW,0BAA0B;IACvC;;OAEG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAC/B,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,0BAA+B,GACzC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CASxB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACnC,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,0BAA+B,GACzC,MAAM,CAoDR;AAkDD;;GAEG;AACH,wBAAgB,2BAA2B,CACvC,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE,0BAA+B,GACzC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CASxB;AAED;;GAEG;AACH,wBAAgB,+BAA+B,CAC3C,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,0BAA+B,GACzC,MAAM,CAoDR"}