{"payload":{"header_redesign_enabled":false,"results":[{"id":"160253825","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"SomniVertix/Minimum-Spanning-Tree-Graph","hl_trunc_description":"CSIS 215 MST Graph using Djikstra's algorithms","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":160253825,"name":"Minimum-Spanning-Tree-Graph","owner_id":35609960,"owner_login":"SomniVertix","updated_at":"2018-12-03T21:07:49.278Z","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":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%253ASomniVertix%252FMinimum-Spanning-Tree-Graph%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/SomniVertix/Minimum-Spanning-Tree-Graph/star":{"post":"3o6oC-GNX0A0MYyxe5mf_w8GvCQuWueqt9MtAYbUMn7V5duxZ9tYSmbl8nvzKttGKB38q_HDAbdOWl0sUoHqTw"},"/SomniVertix/Minimum-Spanning-Tree-Graph/unstar":{"post":"uDROFjD86XEkDgc_hruEG1ETmOW6pbEBV8mdaqvob6hEcLiriLw-FGbE93onqDK2dqWCJgTkaZTTH1Y-XrdDIQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"434HqEqu_JaaKBklxy-kmHAaC6UfwbxJGu8pdxBG2aBqtt3zAajj0ua5TrQxxnSiWT-SR3h9bTYsx-yLA-UCyQ"}}},"title":"Repository search results"}