{"payload":{"header_redesign_enabled":false,"results":[{"id":"347124547","archived":false,"color":"#74283c","followers":3,"has_funding_file":false,"hl_name":"PhantoNull/Minimum-Spanning-Trees-PROLOG","hl_trunc_description":"Minimum Spanning Tree in Prolog","language":"Prolog","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":347124547,"name":"Minimum-Spanning-Trees-PROLOG","owner_id":65261018,"owner_login":"PhantoNull","updated_at":"2021-11-25T10:28:08.633Z","has_issues":true}},"sponsorable":false,"topics":["graph","graph-algorithms","graphs","prolog","mst","minimum-spanning-trees","prims-implementation","prims-algorithm","minimum-spanning-tree","unimib","prims","prims-mst","mst-prolog"],"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":91,"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%253APhantoNull%252FMinimum-Spanning-Trees-PROLOG%2B%2Blanguage%253AProlog","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/PhantoNull/Minimum-Spanning-Trees-PROLOG/star":{"post":"f-Y0h2jhh2p4Sni49-zATYmbWJuZbjMnE25JAuzKQ9ZYslxzEH4iwaJFHdvqvJsooVVqDKND96gXdWsHABnglw"},"/PhantoNull/Minimum-Spanning-Trees-PROLOG/unstar":{"post":"1aZJuzRJgFt7KHf_SEwJRfrceZsamwZ_8WfZI2SF7xAqds3KvF8TfeOgt6uKTYK3oB4FHJ8KJEeGCprPrxrU2g"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"PW58YNzcj1U5Y4WEY8MxDqFqzlCpoRbBA2-0mDrVz_f4mu4TU5hwjbRfdru1oGOHM0ir0mxZRDWzUbGFGveYiA"}}},"title":"Repository search results"}