[szarnyasg]

In LDBC, we have a separate benchmark for graph algorithms: https://ldbcouncil.org/benchmarks/graphalytics/

This focuses on untyped, unattributed graphs and includes algorithms which are often formulated following a vertex-centric programming model (BFS, PageRank, community detection, connected components, etc.). The SNB Business Intelligence already covers a few of these algorithms (BFS, weighted shortest paths) and in the future it may incorporate more.

We plan to run a Graphalytics competition in the spring (on data sets with up to tens of billions of edges) - let me know if anyone is interested in participating in this.

[ashvardanian]

Sounds good, we may participate. Will you be adding larger graph datasets to the list?

[szarnyasg]

Not this time, the largest data sets are going to be graph500-30 and datagen-sf10k-fb. They have 17B and 9.4B undirected edges, respectively.