Algorithm 1.

Markov Clustering Algorithm

Input: $\mathcal{M}$ and r > 1

Output: $\mathcal{C}$: A list of clusters

Methode:

1: t = 0

2: $\mathcal{M}$t = $\mathcal{M}$

3: repeat

4:  t = t + 1

5:  $\mathcal{M}$t = Expand($\mathcal{M}$t−1) = $\mathcal{M}$t−1×$\mathcal{M}$t−1

6:  ${\mathcal{M}}_t=Inflate({\mathcal{M}}_t,r)={\left\{\frac{{(m_{ij})}^r}{\sum _{k=1}^n{(m_{ik})}^r}\right\}}_{i,j=1}^n$

7: until $\mathcal{M}$t converges

8: $\mathcal{C}$: clusters($\mathcal{M}$t)