I have noticed that there are Betweenness and Closeness in the folder.
According to the description:~/graphlab/toolkits/graphalgorithms/graphanalytics.dox, the Betweeness sounds like an approximate Betweenness Centrality algorithm. "The output estimates betweeness using ~3000 randomly selected spanning trees"
I have run the Betweenness algorithm based on a graph file following the format requirement (i.e., <long node_id> [<long nodeid> <float edgevalue>]). ./betweeness --graph ~/graphfiles/soc-Epinions1.txt --samplesize 480 --ncpu 3 --saveprefix BC. However, the algorithm finished in seconds, and all Betweenness scores are zero. So, I guess the Betweenness algorithm does not function properly.
I wondering do you have similar experience with me, as well as what are the difference between your Betweenness Centrality algorithms and the above mentioned algorithms.
Thanks and look forward to your reply!