{"payload":{"header_redesign_enabled":false,"results":[{"id":"573413588","archived":false,"color":"#DA5B0B","followers":0,"has_funding_file":false,"hl_name":"html-3/least-dangerous-path-julia","hl_trunc_description":"O projeto final da materia Introducao aa Otimizacao (COC361). Trata sobre o modelo e algoritmo para encontrar o caminho mais seguro de um…","language":"Jupyter Notebook","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":573413588,"name":"least-dangerous-path-julia","owner_id":77990915,"owner_login":"html-3","updated_at":"2023-01-02T23:06:00.651Z","has_issues":true}},"sponsorable":false,"topics":["optimization","julia-language","project"],"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":91,"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%253Ahtml-3%252Fleast-dangerous-path-julia%2B%2Blanguage%253A%2522Jupyter%2BNotebook%2522","metadata":null,"csrf_tokens":{"/html-3/least-dangerous-path-julia/star":{"post":"Qfx9crDzi1Qn5yIWUvKuasbuJMxS-X3vQekRHcE8FXwp_dnKuMqw6jR9AlFguSLO6s2qhwRSjI1t3ugCzvrYLQ"},"/html-3/least-dangerous-path-julia/unstar":{"post":"a5g__38K1ZzyAtawGjAnQdCHm_RwUcC2MzQYcWEW3hl177kyQXwfCG_FpzjvnEQjPHv_6yvHEOZ690V0ivfiOA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"Z7KHCxIi_5jxG0cVZXIpzRzUZzWOwgHmjmAIjUB8KoCYq-rCVSkpcC0eQj1zA9CTDUEY4PPEP_0YAPQ-wlFQ9g"}}},"title":"Repository search results"}