{"payload":{"header_redesign_enabled":false,"results":[{"id":"492438749","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"snigdhab7/ShortestPath","hl_trunc_description":"Bellman-Ford and Dijkastras' algorithm for shortest path finding ","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":492438749,"name":"ShortestPath","owner_id":62890614,"owner_login":"snigdhab7","updated_at":"2023-11-25T07:27:59.732Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","cpp","graph","pathfinding","dijkstra-algorithm","bellman-ford-algorithm","shortest-path-algorithm"],"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":64,"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%253Asnigdhab7%252FShortestPath%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/snigdhab7/ShortestPath/star":{"post":"iGVbcGgdNbSt0gR4kgDCcYY6vX9eVkZIY4QRnXqLyJK6n7Ox2uXKPKu6iaeW4x9BpeAVg0QsdIDtQl05IOASQQ"},"/snigdhab7/ShortestPath/unstar":{"post":"tcKNW7nucsXXgmqHiupmryUUdJhZcvjPdhwv7mnZrUzHu2vjKH__GuImNAPmsbzokJ5O4KaeP3EQAIqq5pb-ZA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"wdIQwEE5Cot3yhRNkmvRkJx-LHj3-SFwR16OxG7CDXtEQ3F5EValZCvAT_DV9fpUWf2yW54hgt0CSvkd-KdqQA"}}},"title":"Repository search results"}