{"payload":{"header_redesign_enabled":false,"results":[{"id":"544365412","archived":false,"color":"#178600","followers":1,"has_funding_file":false,"hl_name":"greenDev7/DijkstraAlgorithm","hl_trunc_description":"Реализация алгоритма Дейкстры для поиска кратчайшего пути между двумя вершинами и оптимального маршрута на 3D поверхности с использование…","language":"C#","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":544365412,"name":"DijkstraAlgorithm","owner_id":52858802,"owner_login":"greenDev7","updated_at":"2022-11-29T13:08:25.315Z","has_issues":true}},"sponsorable":false,"topics":["shortest-paths","maze-algorithms","obstacle-avoidance","dijkstra-algorithm","shortest-path-problem","shortest-path-routing-algorithm","3d-modelling","shortest-path","obstacle-detection","dijkstra-s-algorithm","shortest-path-algorithm","obstacles","obstacle-avoidance-algorithm","optimal-paths"],"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":49,"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%253AgreenDev7%252FDijkstraAlgorithm%2B%2Blanguage%253AC%2523","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/greenDev7/DijkstraAlgorithm/star":{"post":"EYeJ5gg6PjpfGFhw63AUAaYw7QACXpiJW3GGZkeF_HyV5BuZXeCT74UTSnq_HS9V8-K_e7ReGfr0dYw1TrquNA"},"/greenDev7/DijkstraAlgorithm/unstar":{"post":"utw0hYKKciX0CToySoMcH5EMJq6JFBz2EIJpD1rB8Y10cqJeS2n9vZTzk7QlzG6N1Pt2nr0CYWWY2-KEFu6hgQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"kjcL2C_2m4drk--4AVMXTQe2S5TJn5V3D068p8XHXabP2gjgS6bs4FP8xIonRi5x5ChOtlsoIkk6rw9ahM-Uag"}}},"title":"Repository search results"}