{"payload":{"header_redesign_enabled":false,"results":[{"id":"749110602","archived":false,"color":"#DA5B0B","followers":1,"has_funding_file":false,"hl_name":"ceenaa/shortest_path","hl_trunc_description":"Shortest path algorithm instruction","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":749110602,"name":"shortest_path","owner_id":88087819,"owner_login":"ceenaa","updated_at":"2024-01-27T17:07:34.977Z","has_issues":true}},"sponsorable":false,"topics":["priority-queue","constraint-satisfaction-problem","heap","dijkstra-algorithm","johnson-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":45,"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%253Aceenaa%252Fshortest_path%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/ceenaa/shortest_path/star":{"post":"FjFplK9dkzIbjmITjZFvHZJMOpJ5Q-LNVxiAqJUtsrJU7oo9mmezb0yX9cZChUJVlko5gZxUSCOnXWPlxqa7Kg"},"/ceenaa/shortest_path/unstar":{"post":"vbrKyIXkMSnUZVs2gsCpOKz5WMGhwhktssWGbPlA8GGM7miOcFvwiB4U1mpTMAGfz2swcCEM5mqqMrRCcKDg9w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"arq8nKCyM715_SC6D1tETS4ZsL8B6Q1OUUg_hx_b3RseDtDEsfmmougMyTEEU2TQYSIhQ-elqdsJV3ABzamgwg"}}},"title":"Repository search results"}