Mounir Mallek

The library doesn't support weighted graphs explicitly but you can easily work around that. I'll assume you are using the weights as costs i.e. the more an edge is heavily...

It seems perfectly reasonable to me. In this case I think a ternary operator that will call the function when keep_overlap=False will do the trick. I'll take care of that...

I am not aware that Markov Clustering can even theoretically do a soft clustering. Can you share your Adjacency matrix so we can test it ?

In case the algorithm is actually assigning a node to multiple clusters, do we consider it as a bad behavior and fix it ? cause if its something mcl does...

Ok, so from what I've read it's quite easy to fix. The orignal author simply assigned the node to the 1st cluster it appeared in and only to that cluster...

@hw449 can you email me your graph? I think I have fixed the issu and would like to test it.

I have pushed a solution and tested it on @hw449 graph and it works like a charme. simply execute the following line and it should be okay. `clusters = mc.get_clusters(mc.run_mcl(matrix,...

For that you'd have to wait until @GuyAllard merges my pull request, until then you can download my repo and replace the mcl.py file in `python\Libs\sitepackage\markov_clustering` by mine, it will...

That was poor English on my account ! i'll correct it.

Please specify your inputs and the output you desire, because i'm not sure what do you mean exactly.