@graphty/algorithms / index / MCLOptions

Interface: MCLOptions

Defined in: clustering/mcl.ts:16

Markov Clustering (MCL) algorithm implementation

MCL simulates flow in graphs and finds clusters based on the notion that random walks stay within clusters and rarely move between clusters. The algorithm alternates between expansion (matrix squaring) and inflation (element-wise powering and normalization).

Time complexity: O(V³) per iteration Space complexity: O(V²)

Properties

expansion?

optional expansion: number

Defined in: clustering/mcl.ts:17

---

inflation?

optional inflation: number

Defined in: clustering/mcl.ts:18

---

maxIterations?

optional maxIterations: number

Defined in: clustering/mcl.ts:19

---

pruningThreshold?

optional pruningThreshold: number

Defined in: clustering/mcl.ts:21

---

selfLoops?

optional selfLoops: boolean

Defined in: clustering/mcl.ts:22

---

tolerance?

optional tolerance: number

Defined in: clustering/mcl.ts:20