{"payload":{"header_redesign_enabled":false,"results":[{"id":"329030969","archived":false,"color":"#3572A5","followers":23,"has_funding_file":false,"hl_name":"hj2choi/fast_jigsaw_puzzle_solver","hl_trunc_description":"fragments image and re-assemble them back to original image. #Prim's MST algorithm","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":329030969,"name":"fast_jigsaw_puzzle_solver","owner_id":10559551,"owner_login":"hj2choi","updated_at":"2024-09-03T13:50:07.716Z","has_issues":true}},"sponsorable":false,"topics":["parallel-processing","minimum-spanning-tree","linked-hashmap"],"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":85,"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%253Ahj2choi%252Ffast_jigsaw_puzzle_solver%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/hj2choi/fast_jigsaw_puzzle_solver/star":{"post":"KKUDUq2vyOf0_ve0_BAO2IjznRH_7u2HUYiFv3zJmaHlvG_ENWvqAcMd33VtxoIgZ80NGh-Kjz6FpcNZDilqmg"},"/hj2choi/fast_jigsaw_puzzle_solver/unstar":{"post":"Jyj698e2rg8efDqm05LHJkI6PWDsUpSA6VRA-4Hg8rPEuF-Xpsi_R_HZC3APMm70KTvoLuU2FkSImKO9_ycfAg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"WWnftoKzBr-UtfXsD-OZq_Fvr2WTUEltSS9rCr_vhElCXk1gjdhilhpb2Z4_8ijYj1f9tSNmVkj18e9_M8uLKg"}}},"title":"Repository search results"}