{"payload":{"header_redesign_enabled":false,"results":[{"id":"149605355","archived":false,"color":"#f1e05a","followers":1,"has_funding_file":false,"hl_name":"abdulahadabro/Graph-Theory-Project","hl_trunc_description":"Graph Theory in computer Application. Features of Graph Theory project are: Bipartile, Planner, Tree, paths of 1,2,3,... n length, cycles…","language":"JavaScript","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":149605355,"name":"Graph-Theory-Project","owner_id":3054359,"owner_login":"abdulahadabro","updated_at":"2018-09-20T18:02:10.155Z","has_issues":true}},"sponsorable":false,"topics":["color","tree","planner","graph","path","loops","pathfinder","graph-theory","cycles","length","euler-path","shortest-pathfinding-algorithm","bipartite-graphs","hamiltonian-cycles","eulerproject","shortest-path-algorithm","shortestpath","hamiltongraph","color-graph","izomorphism"],"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":74,"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%253Aabdulahadabro%252FGraph-Theory-Project%2B%2Blanguage%253AJavaScript","metadata":null,"csrf_tokens":{"/abdulahadabro/Graph-Theory-Project/star":{"post":"BP0h1T1Nh2jFM4iKQhTDqs3ZDhtr4VxDi8YiK3Z5hXsJRiV6dxEJBQU3VAd6FlhSDCfz2jTrSitLAujNIT-_mQ"},"/abdulahadabro/Graph-Theory-Project/unstar":{"post":"eYzhHDcUbjC6olKo4tM_xI11hM7QPufZTt0sydN5yDZfBp3mLSQ1SoYz96e7nGFoG_9PCoaLpmL2p6HgH30hDA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"GWarJCFzcfw4YrR9UpwkhJMZ6daorM1gxHx0px7CeK2obDp4H38fZg4EbliXOnnrs2P-bfs0K2w5FmYm6aVqJw"}}},"title":"Repository search results"}