[{"authors":"Kayode Adeniyi","built_at":"2015-08-27T00:00:00.000Z","created_at":"2015-08-27T16:11:22.685Z","description":"This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree. ","downloads_count":3869,"metadata":{},"number":"0.0.3","summary":"This gem builds a tree when an array is supplied and employs either DFS or BFS to search for any child","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"licenses":["MIT"],"requirements":[],"sha":"5da807c9be12a94884dfd83a499670b48e0e96a1a006d04bd65d0dd8fc5382e1","spec_sha":"7258fe0973e2d3c4e03d9d8c3aa33315a75a50ed44b964910ab1b0c91d83f9fc"},{"authors":"Kayode Adeniyi","built_at":"2015-08-24T00:00:00.000Z","created_at":"2015-08-24T18:09:54.796Z","description":"This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree. ","downloads_count":2742,"metadata":{},"number":"0.0.2","summary":"This gem builds a tree when an array is supplied and employs either DFS or BFS to search for any child","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"licenses":["MIT"],"requirements":[],"sha":"4dcda1d0284cefd5474f25c282b08eb4f5c02f0e3ea87ce57026e12ad128586c","spec_sha":"638f0d79254490584f86a11748a7a953c65f6ee6ab2016c2ee9f1b14d6ba0463"}]