Louvain community detection

Louvain community detection for graphology.

Given a graph instance detects communities using the Louvain Method

Leiden/Louvain community detection for ngraph.graph (JS)

Miscellaneous indices for graphology.

graph algorithm

Community finding algorithm.

Community detection algorithms (Louvain, Leiden, Infomap, Walktrap, etc.) for @graphrs

Louvain community detection for Javascript

[NODE ONLY] Given a graph instance detects communities using the Louvain Method

Javascript implementation of the directed louvain algorithm for community detection.

CSL style for Université Catholique de Louvain - Histoire (Français)

A local CLI tool that parses codebases, builds dependency graphs, and outputs interactive architecture visualizations.

Pure-TypeScript implementation of the Leiden community-detection algorithm (Traag, Waltman & van Eck, 2019). Zero runtime dependencies. Faster than graspologic across the standard benchmark portfolio.

Deterministic, install-free structural extraction for TypeScript, Python, Ruby, Elixir, PHP, Kotlin, Dart/Flutter, and Swift codebases — AST → communities → god-nodes → framework & infra adapters, zero LLM/DB/network.

TypeScript port of the Java networkanalysis package that provides data structures and algorithms for network analysis.

Zero-dependency, pure local AST extraction & graph architecture engine powered by Go and Tree-sitter.

Self-contained, deterministic repo-indexing engine: walk + language detection + symbol/import extraction (tree-sitter AST with regex fallback) + import resolution + typed cross-file link-graph + analytics. Ships as a single zero-dependency engine.mjs that

A Jupyter widget using sigma.js to render interactive networks.

Native Node.js/TypeScript implementation of DuckDB MCP extension