This is the second part of the How to Read Graph Database Benchmark series and is dedicated to query results validation of three types of operations:

K-hop
Shortest-Path
Graph Algorithms

Let’s start with K-hop queries. First, let’s be clear about the definition of K-hop; there have been second types of K-hop: