From my understanding Markov clustering (MCL) algorithm is a graph clustering algorithm that takes weighted graph as input and uses Random walk approach for probability assignment of each node on the graph. What is not clear to me is how MCL uses Frobenius norm to perform the final clustering. Also, is there a tool or java codes that I can easily simulate with or adapt? Thanks.