This document describes implementing a breadth-first search (BFS) on the Last.fm social network starting from user 'rj' to sample node degrees. It shows a graph of the average sampled node degree increasing as more users are discovered. The implementation uses multiple threads and worker nodes to process users in a blocking queue, writing results to a .gdf file. Main components and architecture are described.