{"payload":{"header_redesign_enabled":false,"results":[{"id":"163403754","archived":false,"color":"#f34b7d","followers":0,"has_funding_file":false,"hl_name":"snatchagiant/with-CBST-solve-shortest-paths-problem","hl_trunc_description":"This source code is ecoded by C++ and, implemented in console platform. This solution employs the CBST as priority heap to execute the be…","language":"C++","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":163403754,"name":"with-CBST-solve-shortest-paths-problem","owner_id":41437930,"owner_login":"snatchagiant","updated_at":"2018-12-28T15:12:37.970Z","has_issues":true}},"sponsorable":false,"topics":["online-database","shortest-path-algorithm","priority-heap","logarithm-solution"],"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":87,"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%253Asnatchagiant%252Fwith-CBST-solve-shortest-paths-problem%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/snatchagiant/with-CBST-solve-shortest-paths-problem/star":{"post":"EthGkBntQTqRIzZfRNvle7bhzzC8uVkverecm6EYStX0V85hDell_bchQwkjlVVQQ2xBOvYAvxrne9vlSZireA"},"/snatchagiant/with-CBST-solve-shortest-paths-problem/unstar":{"post":"Y1lxnylhCA59QeikNOOiO03ByUIwGQHvm1zhV8Hi__cTKttyERbp_SXXWSkUYA-zKjWzjnjKBe9BWtMU1Lrj3w"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"G_pg-pvkvmqzXgsfe7_Gui5WZ4oxacZgZiq1q5LESFzN92KwQ8bHoB34w5H-n6fKBub9TP34BZVC63OSCUtRIw"}}},"title":"Repository search results"}