{"payload":{"header_redesign_enabled":false,"results":[{"id":"132053532","archived":true,"color":"#b07219","followers":1,"has_funding_file":false,"hl_name":"nahzor/o-1-is-linked-graph","hl_trunc_description":"A graph implementation to do a check to see if two nodes are linked in O(1) time complexity.","language":"Java","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":132053532,"name":"o-1-is-linked-graph","owner_id":2073173,"owner_login":"nahzor","updated_at":"2020-09-04T17:50:31.886Z","has_issues":true}},"sponsorable":false,"topics":["graph-algorithms","graph-datastructures"],"type":"Public archive","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":60,"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%253Anahzor%252Fo-1-is-linked-graph%2B%2Blanguage%253AJava","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/nahzor/o-1-is-linked-graph/star":{"post":"SMzIQfnAgXYCrFl5QMLN862CJ1eCMoOIc_4CaQk7GuHSVEerxKKJtJYOqOAnjkxlVXFgireEtszdABYMlRIaXA"},"/nahzor/o-1-is-linked-graph/unstar":{"post":"HOryA1yBlRVnHM2ohiewcZziIxgYEWRyrejcPCls3Zq1qhO-yJ9iCS30IiNPlcZpIjSkPF-b5QhogRbDndmsWg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"TpO95W7jSQgvSEMMANSPDVM0tita1ilSC0dxh8tfmZjc0mAy5V1raBkPxCWsnvL96_DxQIV9s4K1VLpQFGu3Pg"}}},"title":"Repository search results"}