How eciently can we nd an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to nd every edge in the graph. This problem admits a reconstruction algorithm based on multi-phase Voronoi-cell decomposition and using Õ(n 3/2) distance queries [27]. In our work, we analyze a simple reconstruction algorithm. We show that, on random ∆-regular graphs, our algorithm uses Õ(n) distance queries. As by-products, with high probability, we can reconstruct those graphs using log 2 n queries to an all-distances oracle or Õ(n) queries to a betweenness oracle, and we bound the metric dimension of those graphs by log 2 n. Our reconstruction algorithm has a very simple structure, and is highly parallelizable. On general graphs of bounded degree, our reconstruction algorithm has subquadratic query complexity.