{"payload":{"header_redesign_enabled":false,"results":[{"id":"82212912","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"samuelklam/minimum-spanning-trees","hl_trunc_description":"Computing MSTs with Prim's Algorithm","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":82212912,"name":"minimum-spanning-trees","owner_id":6326515,"owner_login":"samuelklam","updated_at":"2017-05-22T15:41:52.870Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","mst","heap","adjacency-lists","minimum-spanning-trees","prims-implementation","prims-algorithm","adjacency-matrix"],"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":87,"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%253Asamuelklam%252Fminimum-spanning-trees%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/samuelklam/minimum-spanning-trees/star":{"post":"Ou8n4DzoN3lSNCg3xuFc6hswKUrgKYEMrZ2PMc3kh7YgMfertCsfMsXNdBRhF6TgQCe5EGWMR4Op94tzJp16oQ"},"/samuelklam/minimum-spanning-trees/unstar":{"post":"Qtp0dan6yqySOHMdsgRueNqq0pvZtke_BBeVuAD_S9EGY3qjVrkcOWyIFiW7NFjd2WBBeQziE14NPxL3cJCSnw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"PmiFAX3ALX2OmmXyPL1DPfF7X-yBkV4PK-zW5FiJGGZevIei_gk4VIugfZMfGFAdJgLKmkmemNNgIY3ioXppeQ"}}},"title":"Repository search results"}