Performance - JamesBremner/PathFinderJune2021 GitHub Wiki

How does PathFinder2 perform on a large graph?

The Amazon product co-purchasing network from June 01 2003 [1] contains 403,394 nodes and 3,387,388 links.

A text representation of the graph can be downloaded from https://snap.stanford.edu/data/amazon0601.html or https://github.com/JamesBremner/PathFinder2/blob/main/dat/Amazon0601.txt

PathFinder will read the text file and construct the graph in 2.5 seconds

Once the graph is constructed, PathFinder will

• perform a depth first search visiting every node in 0.5 seconds
• find shortest path from a node to every other node ( Dijkstra ) in 7 minutes

1. J. Leskovec, L. Adamic and B. Adamic. The Dynamics of Viral Marketing. ACM Transactions on the Web (ACM TWEB), 1(1), 2007.