Good evening, My interrogation is quite vague… Also the answer is clearly data dependant and so it may be irritating. If so I apologize for it. I am trying to find a suitable way to identify groups in a graph with nodes connected with weighted edges. As I want the process to be as “flexible“ as possible I planed to use MCL algorithm (https://micans.org/mcl/). Also I planed to neglect weak weghted edges (with an offset) befor perfoming the calculation an set a limite to the number of Expantion/Inflation process... I wonder if you have any advice better idea or warning with this ? Thanks / Regards -- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/