mcl-14_137p0
clustering algorithm for graphs
Back to search · Project homepage
Description
The Markov Cluster Algorithm (MCL) is a fast and scalable
algorithm for clustering graphs based on simulation of
stochastic flow. The algorithm was developed by Stijn van
Dongen at the Centre for Mathematics and Computer Science in the
Netherlands.
The MCL algorithm is very fast, very scalable, and has a number
of attractive properties causing it to deliver high-quality
clusterings.
Package information
- Ports path
- math/mcl
- Package architecture
- amd64
- Maintainer
- The OpenBSD ports mailing-list <ports@openbsd.org>
- Categories
- math
- Available flavors
- None listed
These are ports metadata. Binary availability depends on the release, architecture and mirror. Build and test dependencies are not an installation checklist.
Direct dependencies
Build
- textproc/groff STEM->=1.21