
22 Jan
2013
22 Jan
'13
6:04 a.m.
Hello all, I calculate the betweenness-centrality of a large graph (V:150k, E:500k, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS,) with boost::brandes_betweenness_centrality and I can find how to get a indication of the 'completed' part of the algorithm. For example this graph took 1h:38m (single thread 10.8 iMac 3.4ghz) to complete but in order to be able to know the execution time of larger graph im a bit lost... On "one to all" BFS you know how many vertices you have left but this algorithm seems to me lacking a custom visitor or something in order to output some data. Any ideas as Im really new to boost.graph? Thanks a lot, Tasos