{"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":67,"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,"csrf_tokens":{"/teodutu/PA/star":{"post":"zLWc4UzU0c3dlhuvFEmrOZOWDRrfPHnGqxDigl4Ef8SofBFPLNOQPpRkWvrkTk95renkffqIL4pdMw6JM5CPtA"},"/teodutu/PA/unstar":{"post":"D734MmPzj4bD0j6gwKbTU490NYVQLriLuO8tZWD2kPs7fe42Eyy3k7V9hlzgtTKwoz4cNrwWM6hNzAELWE9nTQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"kJ26NhRotzFQirbL_rfEdaoqBfOTthYv3QoT-U9GGJmkeH6EUNXzFRtyXFi-vhTmwCJpdT5GIxFWpro_LmPk6A"}}},"title":"Repository search results"}