{"payload":{"header_redesign_enabled":false,"results":[{"id":"115834501","archived":false,"color":"#178600","followers":17,"has_funding_file":false,"hl_name":"nphdang/gSpan","hl_trunc_description":"gSpan, an efficient algorithm for mining frequent subgraphs","language":"C#","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":115834501,"name":"gSpan","owner_id":16011604,"owner_login":"nphdang","updated_at":"2020-01-04T08:29:17.304Z","has_issues":true}},"sponsorable":false,"topics":["c-sharp","data-mining","graph","parallel-computing","frequent-pattern-mining","frequent-subgraph-mining","gspan"],"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":55,"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%253Anphdang%252FgSpan%2B%2Blanguage%253AC%2523","metadata":null,"csrf_tokens":{"/nphdang/gSpan/star":{"post":"ZqoLglvuOZWjs9iKSRtDi_o9mOEhmwRnTlW-hn3vGsESerLWVNgrdBUiob9tggfouLL5bhEhsR2XQcrg0oGVCQ"},"/nphdang/gSpan/unstar":{"post":"My7lhQ1ZiuyXzz2hu8Gxc4YSDzrYU71oETylDHfo2DJ8UPjEJd6h4Usc8gGH4e8-Ft9BmhYcNTlf3EcxIQ4BFg"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"QZyzc9CFU_bMMlLJrKZ0q8OBxqOPDV9NIhq5ZMCAOeexG5O17XZ1OTDPpPbUcgxlWuKx4vwwsjAP1Lioy3BLOw"}}},"title":"Repository search results"}