Is there a way to approximate the amount of time it will take to complete some of the functions, for example, betweenness centrality? I am running some experimental betweenness computations on large graph sets, and its hard to know when to wait-it-out or to pull-the-plug, so to speak.
Thanks. _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
