{"schema_version":1,"metadata":{"branch":"current","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:41.004595+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/snapshots/packages/amd64/sqlports-7.55.tgz","source_sha256":"fcdbba1b9df747882aa9bab4af20ebec8dac10655069c90f1cd4145c06e1235e","package_count":12031,"source_kind":"sqlports"},"package":{"name":"mcl-14_137p0","path":"math/mcl","url":"/packages/current/math/mcl/","comment":"clustering algorithm for graphs","homepage":"https://micans.org/mcl/","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"The Markov Cluster Algorithm (MCL) is a fast and scalable\nalgorithm for clustering graphs based on simulation of\nstochastic flow.  The algorithm was developed by Stijn van\nDongen at the Centre for Mathematics and Computer Science in the\nNetherlands.\n\nThe MCL algorithm is very fast, very scalable, and has a number\nof attractive properties causing it to deliver high-quality\nclusterings.\n","package_architecture":"amd64","stem":"mcl","readme":null,"dependencies":[{"path":"textproc/groff","type":"build","package_spec":"STEM->=1.21","url":"/packages/current/textproc/groff/"}],"reverse_dependencies":{"count":0,"url":null},"categories":["math"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}