{"payload":{"header_redesign_enabled":false,"results":[{"id":"152118425","archived":false,"color":"#f34b7d","followers":9,"has_funding_file":false,"hl_name":"bymayanksingh/metroworks","hl_trunc_description":"🚄 an application meant for linux users, It helps you find & visualize the Shortest Path between Delhi Metro Stations, it uses Graph Data …","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":152118425,"name":"metroworks","owner_id":19390263,"owner_login":"bymayanksingh","updated_at":"2019-09-21T04:19:46.800Z","has_issues":true}},"sponsorable":false,"topics":["system","graph","metro","stl","cpp11","fim","notify-send","zenity","graphviz-dot-language","delhi","dijkstra-shortest-path"],"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":93,"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%253Abymayanksingh%252Fmetroworks%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/bymayanksingh/metroworks/star":{"post":"Owb6VWO8bGzVcOVYabXqnK-ipR3jK0JUl1ysonVoupt_E8fpBBRiUjISBvIPU1mWZSlz6UlYNviIz59MthGuZQ"},"/bymayanksingh/metroworks/unstar":{"post":"DyNoYntn0QuJmzev-0-DxdrPXfwBrF3TUtErPMPXkN2nJSnz6CV3P-FawmsDjivNQx1AD9u0zvHsTg44K2eTcw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"sQRkp4POCDfR4PyZWJoM7t7yoXvHs-qvHuOe4kY7DZurv3ki7AJAyN27aca1GzwSaSdd0ZO2GM7WoR4EStzhTg"}}},"title":"Repository search results"}