{"payload":{"header_redesign_enabled":false,"results":[{"id":"508266688","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"maxim1770/Backtracking_recursion_graph_way-between-tops","hl_trunc_description":"Лаба 1.12, БЕКТРЕКИНГ РЕКУРСИЯ, ГРАФ, СУЩЕСТВУЕТ ЛИ ПУТЬ МЕЖДУ ДВУМЯ ВЕРШИНАМИ, Корчагин Д., ЯМП, зачет, 2 сем, 2 к, ПМИ","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":508266688,"name":"Backtracking_recursion_graph_way-between-tops","owner_id":72470327,"owner_login":"maxim1770","updated_at":"2022-06-28T11:28:02.806Z","has_issues":true}},"sponsorable":false,"topics":["graph","recursion","backtracking","adjacency-matrix"],"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":75,"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%253Amaxim1770%252FBacktracking_recursion_graph_way-between-tops%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/maxim1770/Backtracking_recursion_graph_way-between-tops/star":{"post":"LAgqTmPL2tOrhTL9MLVH0v0gPuQ6o9FfY580MmjmbMkk6s0uLdV0swUY5LqQ5WQlsetciByqKNOQzPLpAJh57g"},"/maxim1770/Backtracking_recursion_graph_way-between-tops/unstar":{"post":"rvFhJ241WHDUT7YquXjU-tK7Yn1xbqjEVDZrNyCvCeJ_5_qEoZ6EbaAWHhtYhbQhGxaUyaEzPATaAoZexPo8_w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"zC8dh8xLQAeeI9wX_KCAECrGJGFMpUnPASXhcwJjSz43oZUotTIWIjZsNODccgbX2085W4MW2gxdrTOLkxN04g"}}},"title":"Repository search results"}