{"payload":{"header_redesign_enabled":false,"results":[{"id":"23679618","archived":false,"color":"#f34b7d","followers":34,"has_funding_file":false,"hl_name":"thinkphp/dijkstra","hl_trunc_description":"Dijkstra's Algorithm for finding the shortest paths between nodes in a weighted graph.","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":23679618,"name":"dijkstra","owner_id":98550,"owner_login":"thinkphp","updated_at":"2024-04-08T13:44:43.583Z","has_issues":true}},"sponsorable":false,"topics":[],"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":92,"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%253Athinkphp%252Fdijkstra%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/thinkphp/dijkstra/star":{"post":"TKJrdSzdHyUEHaW9Z6c2ay3mCILhWaekkiivDhOvVZdBoZDX5ejKB4AtCryzneELT4jzOQo7IqiiT7ZfDqvxvg"},"/thinkphp/dijkstra/unstar":{"post":"NHZm5TgSdKdQay4QwxjA_zvc2ApCbhAYS-KVOdmZq64odm1GQwD710DdQGcK0k5rje9828UGDj036K8F8hU0Hw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"uAYB6jLzaAMkTR1q9eIAt72gcS0JDYMexnawaK8O2E0qlOvb3i38AvxBIkz3irVnwZlVn4UhDGaQu8arYdhEBQ"}}},"title":"Repository search results"}