{"payload":{"header_redesign_enabled":false,"results":[{"id":"614309522","archived":false,"color":"#DA5B0B","followers":10,"has_funding_file":false,"hl_name":"teddyoweh/Trek","hl_trunc_description":"Using graph theory algorithms and simulations, to optimaize paths and travel times between nodes on a geospatial map","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":614309522,"name":"Trek","owner_id":76883580,"owner_login":"teddyoweh","updated_at":"2023-03-22T08:37:27.708Z","has_issues":true}},"sponsorable":false,"topics":["graph-algorithms","network-graph","data-structures","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":60,"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%253Ateddyoweh%252FTrek%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/teddyoweh/Trek/star":{"post":"Tot6m9mu4k6k3HUM8u1fB-EZpG6p2eEyu25eFkRT_AL97VISVsufFnCxRuzSaS5BUPq5TmbwC-93K7L0lMhNcw"},"/teddyoweh/Trek/unstar":{"post":"-UAdY6y3m6sQ22PBHY6o7jizVZOTNMGrwBu1XNiXodC8e3eqfNIH3psZbzT3tKBxkGM_YlXsdVI4CS4wyw1Qwg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"3BgLIMN67e4UFFzKFr14JoXkCvJQeuSVo667RU6EDZ7JRfZlTrbhPc4LhgeAVhjSQgmwctTSmnqZcXLHSzuKYw"}}},"title":"Repository search results"}