{"payload":{"header_redesign_enabled":false,"results":[{"id":"188397946","archived":false,"color":"#00ADD8","followers":44,"has_funding_file":false,"hl_name":"LdDl/ch","hl_trunc_description":"Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.","language":"Go","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":188397946,"name":"ch","owner_id":8864477,"owner_login":"LdDl","updated_at":"2023-12-07T00:06:00.032Z","has_issues":true}},"sponsorable":false,"topics":["graph","osm","pathfinding","dijkstra","isochrones","shortest-paths","breadth-first-search","hacktoberfest","dijkstra-algorithm","shortest-path-algorithm","isochrone-map","contraction-hierarchies","turn-restrictions","hacktoberfest-accepted","hactoberfest2022"],"type":"Public","help_wanted_issues_count":2,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":56,"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%253ALdDl%252Fch%2B%2Blanguage%253AGo","metadata":null,"csrf_tokens":{"/LdDl/ch/star":{"post":"-qX0eZzo2T_Qfc3v6Q1TVUJZeLvDKOegQy81iylj68YqLa7BLe4UFEN6V4G6opDcjoJVjUhmzIv3My99uXwZUA"},"/LdDl/ch/unstar":{"post":"TaxUDiEBqZSWhN3yWbeZcbG_iLQJLMHTDvVJOqV5XZCNwIruUAkxsac_STnDm-TS1lWmZPhe8J9H-YN_VRisBw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"JQlGGxHBn85SbgsZjlTRat4f8t9MXuq8x9bVdSQKck-p_XTwyJW2PwKIWITQSdBp09nDyY_fp-PuoudwOu5kNQ"}}},"title":"Repository search results"}