{"payload":{"header_redesign_enabled":false,"results":[{"id":"17959062","archived":false,"color":"#f34b7d","followers":2,"has_funding_file":false,"hl_name":"nitinsh99/Prim-s-Algorithm-Using-Fibonnaci-Heap","hl_trunc_description":" Implement Prim’s Minimum Cost Spanning Tree algorithm, MST, using a simple data structure and fibonacci heap, called heap scheme, and me…","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":17959062,"name":"Prim-s-Algorithm-Using-Fibonnaci-Heap","owner_id":1389212,"owner_login":"nitinsh99","updated_at":"2018-03-26T01:53:37.685Z","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":118,"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%253Anitinsh99%252FPrim-s-Algorithm-Using-Fibonnaci-Heap%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/nitinsh99/Prim-s-Algorithm-Using-Fibonnaci-Heap/star":{"post":"lbHtCl22O4dfFvVYpIFzQ8WLAR3pb2h7Z9pxNiqPWLUBpg1U0dqUXS4-7ugYwj82EfrRmbQ6SEqzPx6XeWzmvg"},"/nitinsh99/Prim-s-Algorithm-Using-Fibonnaci-Heap/unstar":{"post":"UNPI_X3ZxgoZcmmgGXMwxHzjP9kV1pAAQdEOIDbY57Lax1IC7goomH4HooWxHDsAswq4BGKxXdx-jyrvOf_Ciw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"tR3uLyje5GdcVoyyR0zROxffx23auPTymaCBSNxTxOhM5Sf8_bRnol1A_oOh9Px00rexyBEnYM1RbWL0Xl6Ohg"}}},"title":"Repository search results"}