What the hell sort of library would you crack out to do a breadth first search traversal? This is my main problem with the OP, BFS isn&#x27;t some arcane complex cryptic algorithm, it&#x27;s a way of moving through a data structure that becomes natural and very obvious when you think about how you can effectively traverse it for some tasks.<p>If I were ever to want to traverse something in a breadth first search manner, then I would just write it. It would take longer to search for another library and read how it&#x27;s somehow implemented this search than it would to write it, test it, get it reviewed, and we&#x27;ve still avoided adding another potentially crappy dependency to our project.<p>It&#x27;s not category error to compare this to leftpad. leftpad actually makes more sense imo, as it&#x27;s a common microfunction that may be used more than once. BFS is typically far more coupled with the underlying data and is more naturally written inline.