{"payload":{"header_redesign_enabled":false,"results":[{"id":"185040015","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"mmohajer9/trie-ds","hl_trunc_description":"a CPP program to find the shortest path between two nodes in trie data structure and a complete implementation.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":185040015,"name":"trie-ds","owner_id":34323369,"owner_login":"mmohajer9","updated_at":"2021-02-19T17:21:24.617Z","has_issues":true}},"sponsorable":false,"topics":["tree","cpp","data-structures","trie-structure"],"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":78,"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%253Ammohajer9%252Ftrie-ds%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/mmohajer9/trie-ds/star":{"post":"BgrnNre0dXwozQbWUZmgYK-Xcxi4PV1WJndHsmv8Nq7eShsM7DHz07vg3gLE8pkkdNB7MoaHez0hyRiyTT2Lyw"},"/mmohajer9/trie-ds/unstar":{"post":"TCq8vggWE23SBdRNciYYO8XTqIE1rw806b5o4jyEMPikHKQFqXw0pqcVtbXsmNRSI8v8VjkX5TT6SNlVSUVTEg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"P8jYiknTPe-PS0r8w5DdDivIuEcoqDvK-EtpHHkuRzk3_YVFm6WGup7U_7uAEarHppOYvTa5I_HSjQWA2qarVw"}}},"title":"Repository search results"}