{"payload":{"header_redesign_enabled":false,"results":[{"id":"740226135","archived":false,"color":"#b07219","followers":1,"has_funding_file":false,"hl_name":"Hadley-Dixon/RoadTrip","hl_trunc_description":"A graph traversal algorithm that plans the shortest car trip between two countries","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":740226135,"name":"RoadTrip","owner_id":104175462,"owner_login":"Hadley-Dixon","updated_at":"2024-06-20T20:26:02.302Z","has_issues":true}},"sponsorable":false,"topics":["graph-theory","object-oriented-programming","data-structures-and-algorithms","traversal-algorithms"],"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":75,"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%253AHadley-Dixon%252FRoadTrip%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/Hadley-Dixon/RoadTrip/star":{"post":"q6zuUgYvguXlIKqRgKHigHOIhR8-dyAGj-gzdzW2pqkFwwL7iFndNIeWV30nMfaIDxHD7_Su1hvY2VOG-7pESA"},"/Hadley-Dixon/RoadTrip/unstar":{"post":"Yzrb-t0GNg4LQTKMY6vBdTNsZarNmNUTzD8bdH9nxnVVd_gGzLV7c_A5YHS0EBRpQtiVzXS3KB30fsMzNYmD1A"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"6Rd8H7c3D-c8_QM9igdsRMwcr-i_PhyGrKsficQfbZN-KAFl-I-7ZBdKQvb4eRhJ1JoQtIdmeNJcOQSgS3yqwA"}}},"title":"Repository search results"}