Without a machine to check I just have a couple of comments.
The fix will probably (in git) kill a lot of speed. Based on my test with big graphs that a race will happen, i fixed it wih:
you just need to wrap only the "update_centrality()" functions (both vertex and edge) and one function further down, "divide_dy_two" near the "if_undirected".
With these things everything works great and no problem with speed even in big graphs.
-- 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.