{"payload":{"header_redesign_enabled":false,"results":[{"id":"169917227","archived":false,"color":"#f34b7d","followers":3,"has_funding_file":false,"hl_name":"teodutu/PA","hl_trunc_description":"Proiectarea Algoritmilor - UPB 2019","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":169917227,"name":"PA","owner_id":19818392,"owner_login":"teodutu","updated_at":"2019-06-15T14:02:22.137Z","has_issues":true}},"sponsorable":false,"topics":["algorithms","tarjan","astar","backtracking","dfs","dijkstra","dynamic-programming","bfs","minimax","greedy-algorithms","kruskal","upb","divide-and-conquer","kahns-alogrithm","bellman-ford","edmond-karp"],"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":74,"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%253Ateodutu%252FPA%2B%2Blanguage%253AC%252B%252B","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/teodutu/PA/star":{"post":"0kxj80jkvIdPWEGS1p4GkBYdcaUC-hV_mr4vCdpaoAA5xPlM9wZ_JQpv0YMTLbgz18DkPI-f2UIzeKR8Tc_rUA"},"/teodutu/PA/unstar":{"post":"dH2a6M367X8VI-YpSc9bi1GZ-VVBS4Rz8NYi8bQlzUNPiYRDvJSSIgDx-EUfr4rEXwqiymi_49MoTWNT6V3YYw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"HUaN3knKQJwtsauUTP9SYIyN2Vhf6wdYA-iXeW-PCsL2sL5Zx78d6uyfpcc2uEMvW-TgAK6MHz7jKYqT3GGPDg"}}},"title":"Repository search results"}