When using the algorithm write procedure, which means writing the results back into the main Neo4j graph, the procedure will return some information about its execution time:
- createMillis: Time to create the projected graph
- computeMillis: Time to run the algorithm
- writeMillis: Time to write the results back
Let's use these parameters to check the PageRank or Louvain algorithms' performances with a slightly larger graph compared to the one we've used so far. To do so, we are going to use a social network graph provided by Facebook during a recruiting Kaggle competition. The dataset can be downloaded from https://www.kaggle.com/c/FacebookRecruiting/overview. It contains 1,867,425 nodes and 9,437,519 relationships. You can import it into Neo4j using your favorite import tool (LOAD CSV, APOC, or the Neo4j command-line import tool). In the rest of this example, I'll use Node as the node label and IS_FRIEND_WITH as...
