Packages

ex_leiden

0.2.0
0.5.0 0.4.1 0.4.0 0.3.1 0.3.0 0.2.0 0.1.0 0.0.3 0.0.2 0.0.1

A pure Elixir implementation of the Leiden algorithm for community detection in networks. The Leiden algorithm improves upon the Louvain method by addressing resolution limits and ensuring well-connected communities. Supports both modularity and CPM quality functions.

HexDocs

Current section

Files

Jump to
Readme
10 Versions
2 Dependencies
Dependants
Files
Activity
ex_leiden CHANGELOG.md
Raw

CHANGELOG.md 

# Changelog



All notable changes to this project will be documented in this file.



The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),

and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).



## [Unreleased]



## 0.2.0 - 2025-09-12



### Added



- [Option] add `community_size_threshold` option for algorithm termination control. When set, the algorithm terminates if all communities are at or below the specified size threshold. Takes precedence over `max_level` when both are set.



## 0.1.0 - 2025-09-11



### Added



- [Option] add `validate_opts/2` for cast and validate options.

- [Source] add `build!/1` for converting various graph input formats to standardized `t:Source.t()` representation.

- [ExLeiden] add `ExLeiden.call/2`, we complete Leiden algorithm implementation with support for modularity and CPM quality functions