Cyclops Tensor Framework
parallel arithmetic on multidimensional arrays
|
Go to the source code of this file.
Namespaces | |
CTF | |
Functions | |
void | btwn_cnt_fast (Matrix< int > A, int b, Vector< double > &v, int nbatches=0, bool sp_B=true, bool sp_C=true) |
fast algorithm for betweenness centrality using Bellman Ford More... | |
void | btwn_cnt_naive (Matrix< int > &A, Vector< double > &v) |
naive algorithm for betweenness centrality using 3D tensor of counts More... | |
int | btwn_cnt (int n, World &dw, double sp=.20, int bsize=2, int nbatches=1, int test=0, bool sp_B=1, bool sp_C=1) |
char * | getCmdOption (char **begin, char **end, const std::string &option) |
int | main (int argc, char **argv) |