{"payload":{"header_redesign_enabled":false,"results":[{"id":"163792762","archived":false,"color":"#b07219","followers":2,"has_funding_file":false,"hl_name":"rahul1947/SP12-Breadth-First-Search-and-Enumeration","hl_trunc_description":"Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Impleme…","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":163792762,"name":"SP12-Breadth-First-Search-and-Enumeration","owner_id":10773135,"owner_login":"rahul1947","updated_at":"2019-01-06T05:51:18.038Z","has_issues":true}},"sponsorable":false,"topics":["stack","pathfinding","enumeration","permutation","combinations","breadth-first-search","depth-first-search","diameter","connected-components","strongly-connected-components","topological-order","knuths-algorithm-l","lexicographic-sort"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":48,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Arahul1947%252FSP12-Breadth-First-Search-and-Enumeration%2B%2Blanguage%253AJava","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/rahul1947/SP12-Breadth-First-Search-and-Enumeration/star":{"post":"BbeiZCTbV55-fp1uUCisrqnIh-VuuX4y6bAKQcIGnr8gj6wEV29swutLNt6ptL3JCZ1XMv-RjYybIRV9vqXFrA"},"/rahul1947/SP12-Breadth-First-Search-and-Enumeration/unstar":{"post":"-xvXwXODbdR6HtEDFVAbMtUgcipL-OFvnUTALbgbfDKM4LneQAmtcBBhdW7LkG6QfB61n2EJMFG3pydcCMg5pQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"Cd15Akasrz3pSGxJdajWXa7b6rH0yjqe3yttsyoQpq8CXnJgAohVyNM_wUbbaP6n2tb2q7ba1ZKX7Jrhl-DuUA"}}},"title":"Repository search results"}