{"payload":{"header_redesign_enabled":false,"results":[{"id":"387824105","archived":false,"color":"#f34b7d","followers":3,"has_funding_file":false,"hl_name":"Ifera/PathMapper","hl_trunc_description":"A data structures project utilizing Dijkistra algorithm and AdjacencyList to find the shortest path between two nodes.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":387824105,"name":"PathMapper","owner_id":32965703,"owner_login":"Ifera","updated_at":"2021-07-20T17:58:26.446Z","has_issues":true}},"sponsorable":false,"topics":["opensource","datastructures","cpp","eme","nust","shortest-path-algorithm","adjacency-list","dijkistra-algorithm","path-mapping"],"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":75,"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%253AIfera%252FPathMapper%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/Ifera/PathMapper/star":{"post":"qrmFqiNyWSf0etCcmr-OHp_pwXup4s1efUsTm3rHFZgMNjOY0W8WsZ03RYITozAXjmReFBJ8dyOEDeUtQOTmJw"},"/Ifera/PathMapper/unstar":{"post":"0UGsPfSZOy--UtxqqRt03ZvX6oh_3VxXBW3NXOf1IHor0Zb7Oa7SZVJCksP0nosOm9HstsIas4q7D2gWoX9FsQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"FTyQu8H0VyNp9AgOG1hWhWM5sK4k0akH5ywRbWTKF0mr4jVdnW5DZcFT9lHDpB8RaYab0CQKppnbhLoZ6SppJQ"}}},"title":"Repository search results"}