# Module utils/graphAlgorithms

#### Fileoverview

Graph algorithms for MEP relationship-network OSINT.

Pure, deterministic helpers consumed by `network_analysis`:

- buildAdjacency — adjacency map from a weighted edge list.
- bfsLimited — depth-bounded BFS ego-network extraction.
- weightedDegree — weighted-degree centrality per node.
- betweennessCentrality — Brandes' algorithm (weighted, Dijkstra-based, O(V²·log V) with the current array-backed priority queue).
- labelPropagation — deterministic asynchronous label-propagation community detection.
- modularity — Newman's modularity Q for a partition.

Algorithms are deterministic — every iteration orders nodes/edges by string comparison so identical input always produces identical output, satisfying the OSINT reproducibility requirement.

ISMS Policy: SC-002 (Input Validation), AC-003 (Least Privilege).

#### Since

1.4.0

## Interfaces

WeightedEdge

## Type Aliases

AdjacencyMap

## Functions

betweennessCentrality
bfsLimited
buildAdjacency
labelPropagation
modularity
weightedDegree