{"payload":{"header_redesign_enabled":false,"results":[{"id":"357182137","archived":false,"color":"#3178c6","followers":1,"has_funding_file":false,"hl_name":"neuodev/Undirected-Graph","hl_trunc_description":"Building a PriorityQueue, Graph and applying the shortest Distance Algorithm (Dijkstra's Algorithm ), Cycle Detection, Minimum Spanning T…","language":"TypeScript","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":357182137,"name":"Undirected-Graph","owner_id":72753578,"owner_login":"neuodev","updated_at":"2021-04-14T10:30:33.603Z","has_issues":true}},"sponsorable":false,"topics":["tree","graph","dijkstra-algorithm","spanning-trees","shortest-path-algorithm","prim-s","minimumspanningtree"],"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":122,"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%253Aneuodev%252FUndirected-Graph%2B%2Blanguage%253ATypeScript","metadata":null,"csrf_tokens":{"/neuodev/Undirected-Graph/star":{"post":"rpNrbt1R8wgkFLjZiHKcFbWTN6gnuOV49YE2Zw-xI1-6LRlAw4FcaCra9jx33hv5gmNVcjQdD8C8aftqIk7Lqg"},"/neuodev/Undirected-Graph/unstar":{"post":"BWTNp0Ke8rCsGZM2kWRs0oB74LfulN2DzXLGOYBdNSLwS7xzpNi2mcKl6kSA1ZmqsjLaCP3KE31hhBFXHOauHg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"dlcOGc-9AvyXfX-NilY6eiqlPg6EeMou6IXMNzjFp_RaTKEDj1d-XSdjXO-bg3e0FPzcfFOzUpxQ1mM1DsNNpw"}}},"title":"Repository search results"}