{"payload":{"header_redesign_enabled":false,"results":[{"id":"51965616","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"ParallelProgramming-UARK-BAPD/Minimum-Spanning-Tree","hl_trunc_description":null,"language":"C++","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":51965616,"name":"Minimum-Spanning-Tree","owner_id":17089895,"owner_login":"ParallelProgramming-UARK-BAPD","updated_at":"2016-02-23T22:16:46.649Z","has_issues":true}},"sponsorable":false,"topics":[],"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":76,"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%253AParallelProgramming-UARK-BAPD%252FMinimum-Spanning-Tree%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/ParallelProgramming-UARK-BAPD/Minimum-Spanning-Tree/star":{"post":"tCldLunImxqXb0Oj_AuZ5WBIVyF3CFKITP1UgVtuESBc8eR-mR8ScIRaEddE-v9CCqOVOHqpkeCHLBp9LmqQIQ"},"/ParallelProgramming-UARK-BAPD/Minimum-Spanning-Tree/unstar":{"post":"LgTJiVQsJ2P1g8qhskXo2wBp_YK-XC8_8IDxt6lj06PyKNt2lqxjkE3YVGprOWQFtlV-3LskZVuddCbXxwW-MQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"1ccUUKBY9OuNfX9_Jgf_o2YTzUgfJit7MBOachKymO68UHmFBAeF7Fksrp5u8z9uhCfMK0TtxAQt9og1LCpJMw"}}},"title":"Repository search results"}