{"payload":{"header_redesign_enabled":false,"results":[{"id":"532452038","archived":false,"color":"#dea584","followers":2,"has_funding_file":false,"hl_name":"lucidfrontier45/tree_traversal","hl_trunc_description":"A Rust library for finding the optimal leaf node in a tree structure.","language":"Rust","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":532452038,"name":"tree_traversal","owner_id":655305,"owner_login":"lucidfrontier45","updated_at":"2023-03-20T14:57:35.099Z","has_issues":true}},"sponsorable":false,"topics":["rust","tree","algorithms","optimization","tree-search","optimization-algorithms","integer-programming","combinatorial-optimization"],"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":78,"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%253Alucidfrontier45%252Ftree_traversal%2B%2Blanguage%253ARust","metadata":null,"csrf_tokens":{"/lucidfrontier45/tree_traversal/star":{"post":"Pl_MG5-yTugvSqiu-ZIAbV5WzGaRbBXltFqAG_9SnhQwo4wnQrx2ITeMa4qGjk2qPSqgtUsIg77ngOLmr91dWw"},"/lucidfrontier45/tree_traversal/unstar":{"post":"Xn_z46wkIVEPHY9SfIHEa89Me9bVsP8dGa6CSALhKDg61SiY5ieGO27PM-CMtNXUEyV3o9_pStZQe-7MZE9pwQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"KT3Colk7UKvDiySVxpo6oEh05F51Hz2QcC0KTox0PAMuZaRowzY1ddDAV4736rvGbDiB1r2HUqclh0DF1d2pPw"}}},"title":"Repository search results"}