{"payload":{"header_redesign_enabled":false,"results":[{"id":"124398382","archived":true,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"0x01h/dijkstras-algorithm","hl_trunc_description":"Dijkstra's algorithm to find shortest path distance using random graph generator on 4D array.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":124398382,"name":"dijkstras-algorithm","owner_id":32897657,"owner_login":"0x01h","updated_at":"2018-04-14T12:20:57.407Z","has_issues":true}},"sponsorable":false,"topics":["cpp","array","shortest-paths","dijkstra-algorithm","shortest-path","dijkstra-shortest-path","dijkstras-algorithm"],"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":94,"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%253A0x01h%252Fdijkstras-algorithm%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/0x01h/dijkstras-algorithm/star":{"post":"K0GkgnTSuVRcqoCLbMx0ggPEsHYXFCqCr_joTdoh3Hy--_rrBlZECgz9wMtf6Q_vaaAnL-X2PQ3VWNBdB3xCWw"},"/0x01h/dijkstras-algorithm/unstar":{"post":"f_ECTsEB3igfh9F29he6hkMhrcfjzBcMr1vCKX3XGJPpN83bmJWHutgpIScmw3eArszoosal9Lc-2W_o9UBpnQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"2IFFOGErCeT3KzcbqoOLgtEKci4fkIUys8QSk4UM6jHW41negUHjVUWsgFoBA6ucZtURyUK_IpqYnpMGI6_stg"}}},"title":"Repository search results"}