{"payload":{"header_redesign_enabled":false,"results":[{"id":"113170313","archived":false,"color":"#555555","followers":0,"has_funding_file":false,"hl_name":"wntun/Dijkstra-shortest-path","hl_trunc_description":"Subway shortest path is calculated using adjacency matrix and Dijkstra's algorithm","language":"C","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":113170313,"name":"Dijkstra-shortest-path","owner_id":15102642,"owner_login":"wntun","updated_at":"2017-12-05T10:56:25.723Z","has_issues":true}},"sponsorable":false,"topics":["subway","pathfinding-algorithm","shortest","dijkstra-shortest-path","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":101,"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%253Awntun%252FDijkstra-shortest-path%2B%2Blanguage%253AC","metadata":null,"csrf_tokens":{"/wntun/Dijkstra-shortest-path/star":{"post":"0XZ-1H1RWhaOw--b55DzRLrr0J_adxEY7L6YLlpxkqCfQEqza9Otk29ag24Et2hUuj13N49YIU28bZ5U9Dk2TQ"},"/wntun/Dijkstra-shortest-path/unstar":{"post":"-wNtKH16bPHBB4pDAAxWK0f9q7x0lPRqYV7-2sEf4WF7X-u08TV2coL3rQ9FFX6x0pctr2KIFg8bC6avArT_Hw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"M-ivJCdEmg2ms-R0F0e6LxG8waaTsL1Ls79oKf4ci3yHXPeQdPC1KkBKLDiUzmz5h_3jfIZf7X6zeyAOoOtPEA"}}},"title":"Repository search results"}