{"payload":{"header_redesign_enabled":false,"results":[{"id":"132741497","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"shammill/Graph-Theory","hl_trunc_description":"Another University Project I completed in 2014. C++ Graph Theory, implementing Dijkstras Algorithm, Kruskal’s Minimum Cost Spanning Tree …","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":132741497,"name":"Graph-Theory","owner_id":11308595,"owner_login":"shammill","updated_at":"2018-05-09T11:35:02.949Z","has_issues":true}},"sponsorable":false,"topics":["cplusplus","graph-algorithms","mst","graph-theory","bfs","breadth-first-search","minimum-spanning-trees","dijkstrasalgorithm","dijkstra-algorithm","kruskal-algorithm","bfs-algorithm","kruskals-algorithm","minimum-cost-spanning-tree","breadth-1st-search","dijkstras-algorithm"],"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":61,"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%253Ashammill%252FGraph-Theory%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/shammill/Graph-Theory/star":{"post":"FEu83HulsvxiU-jDglrxnJWAwPVEpusm3TZpKM0VeA4sCj7CKiEskanjTkFwlNj-wPEjHaS7rUPfY5_2LF5ozQ"},"/shammill/Graph-Theory/unstar":{"post":"hr3sINECnP9HaEHdMeTTgSVjCQ-dNjS3w5oRpkd30ge6ICCoq3IsWhBnjjzOR93LzFNJTGcpzVO5fb8Sj4rAwQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"wK462-K7N19yljY8AwH0xA-emGQE33b3O73DmTgULbz0SrI1WtV_D9hb80ycQ1Nb_g38CZf5fPirseQU5SU_vQ"}}},"title":"Repository search results"}