{"payload":{"header_redesign_enabled":false,"results":[{"id":"149013457","archived":true,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"krplata/graphs","hl_trunc_description":"Shortest Path Tree and Minimum Spanning Tree algorithms for graphs.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":149013457,"name":"graphs","owner_id":38192743,"owner_login":"krplata","updated_at":"2018-10-06T14:12:23.217Z","has_issues":true}},"sponsorable":false,"topics":["graphs","dijkstra","prim-algorithm","adjacency-matrix","bellman-ford","adjacency-list"],"type":"Public archive","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":79,"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%253Akrplata%252Fgraphs%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/krplata/graphs/star":{"post":"aQjyjZEoCRUyW7pKiYM_X8aYUFsgrR-HMVWus1SNf22IXDiOzh4b3BRN8tCSNEs35ig1bRfMfotIZ1H48ubRwA"},"/krplata/graphs/unstar":{"post":"2lyEJ3cy0kMcb-fuvHrPhJLTF872-ybJt4fPCnTGEE0t64SzYaA_zcn-9OAU2tbA-2ZT0az9b5929lzZ1Hz4-A"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"sur9CQv1xxVspGPczpKx3bIeaJqp9cDNcLvJE8OnwT8IuAroOvo3-C7zDGhFAbnsJla8sbejHXQUyEfx3FU5EA"}}},"title":"Repository search results"}