Farzad Khorasani

Hi and thank you for your interest in PaRMAT! For using PaRMAT in Windows OS, You will have to compile the repository files using a C++ compiler for windows (e.g....

Hello, No I have not. One thing you should consider for very large graphs is the number of vertices. If the number of specified vertices is bigger than what an...

Hi @yzhwang, Thank you for your interest. There are a few points which might explain the results you’re observing: - The reason why the number of iterations in SSSP and...

The specific algorithm to run should be configured according to the instructions I created [here](http://farkhor.github.io/CuSha/). If you want to run any of the algorithms provided, you can uncomment it in...

Can you please be more specific about the structure of the input file? Note that implemented PR requires the number of neighbors of the destination vertex be provided in the...

Please use this program to transform the structure of your input file to the form required for PR. https://gist.github.com/farkhor/34aaccb593022fc9fe87

The SSSP example expects the 3rd argument in the edge-list to be the edge weight. If such thing does not exist, it assumes the edge weight to be 0, as...

The simplest execution of CuSha in Ubuntu 14.04 with `$ ./cusha --input soc-LiveJournal1.txt --method CW` and with BFS specified as the algorithm results in 10 iterations while the input graph...

Please start with the simplest algorithm (BFS) by un-commenting the corresponding line in [`user_specified_global_configurations.h`](https://github.com/farkhor/CuSha/blob/master/common/user_specified_global_configurations.h). It seems to me that you want to run PageRank but you're using the same original...

Have you tried running with a different `arbparam` input as the source node for BFS? Maybe the structure of the graphs you're using have different indices? Can you also profile...