Discover a bounded neighborhood in BFS order, with minimum hop distances and one exact parent edge per node. Input index construction still costs O(V + E); limits bound result size and traversal work, not total elapsed time.
Discover a bounded neighborhood in BFS order, with minimum hop distances and one exact parent edge per node. Input index construction still costs O(V + E); limits bound result size and traversal work, not total elapsed time.