I know this is probably a very simple question to answer for those on here, but what are, or how does one determine the optimal values for the community_structure algorithm (http://projects.skewed.de/graph-tool/doc/community.html#graph_tool.community... I know that the documentation states a history_file is available for this purpose, which I understand, but I'm confused as to what I am supposed to look for? Is there a certain pattern over a number of iterations that shows an optimal fit? Sorry if this is a bit confusing, but I'm very curious with respect to a kind-of tutorial on how to take the community_structure algorithm, decide the input values (on the basis of something?), and then determine which values fit the graph (again, on the basis of something else). My next step is, of course, to analyse Reichardt and Bornholdt theoretically to try and make sense of what I need to look for in this algorithm to apply it to something. It looks like a very powerful algorithm, but the theoretical basics have me baffled. Thank you so much for your help! -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.