I have a large graph $G$, which may be either directed or undirected. How would I use
BreadthFirstScan to efficiently and uniformly sample the set of vertices a fixed shortest distance of $D$ away from some vertex $v_i \in V$?
Start with a graph and a distance
Find the distance of a vertex (e.g. vertex 300) to all others:
Alternative way to extract vertices: