{"payload":{"header_redesign_enabled":false,"results":[{"id":"798024824","archived":false,"color":"#b07219","followers":0,"has_funding_file":false,"hl_name":"ashsProjects/TSP_Heuristic_Algorithms","hl_trunc_description":"This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There…","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":798024824,"name":"TSP_Heuristic_Algorithms","owner_id":101825086,"owner_login":"ashsProjects","updated_at":"2024-05-10T04:15:01.624Z","has_issues":true}},"sponsorable":false,"topics":["java","approximation","nearest-neighbors","heuristics","tsp","vincenty","tsp-problem","traveling-salesman-problem","3opt","2opt"],"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":68,"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%253AashsProjects%252FTSP_Heuristic_Algorithms%2B%2Blanguage%253AJava","metadata":null,"csrf_tokens":{"/ashsProjects/TSP_Heuristic_Algorithms/star":{"post":"B1CEVCvxycgYAcNwg6Ay_gqbM6QXcBtQbO4p4TVvf9EoLfQ1cGTPgOg0lrhypymHSUbugHIJcPeiodCdNDjtgg"},"/ashsProjects/TSP_Heuristic_Algorithms/unstar":{"post":"dJZNovVdeUM9--NQl5bAX2tTzRbDY2kDpmouOQz52rUXgyQQ0F0dOAEwhgqYFDY_RyvfqUifb70R-8KWG08-NQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"WHwzpZRuaZLrGjTj3ISq524thLmAm2NzL40745fsPD_Ak9nyR8zr6dxNZQs0onYXRBIvy2PY2yrzUKidI1NlJw"}}},"title":"Repository search results"}