{"payload":{"header_redesign_enabled":false,"results":[{"id":"362522420","archived":false,"color":"#a270ba","followers":25,"has_funding_file":false,"hl_name":"harshangrjn/LaplacianOpt.jl","hl_trunc_description":"A Julia/JuMP Package for Maximizing Algebraic Connectivity of Undirected Weighted Graphs","language":"Julia","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":362522420,"name":"LaplacianOpt.jl","owner_id":8387070,"owner_login":"harshangrjn","updated_at":"2024-05-08T23:41:43.934Z","has_issues":true}},"sponsorable":false,"topics":["graph-algorithms","optimization","semidefinite-programming","discrete-optimization","fiedler-vector","laplacian-matrix","algebraic-connectivity","robust-networks","mixed-integer-optimization"],"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%253Aharshangrjn%252FLaplacianOpt.jl%2B%2Blanguage%253AJulia","metadata":null,"csrf_tokens":{"/harshangrjn/LaplacianOpt.jl/star":{"post":"6X4LOVpkuEZ2owot1viwlvmM7DDAw6ScYzf2qOqpxuNrsPpiTjoK5BJNGjPL2l9vEQ8CZA6jyOQNdu7YcDamjg"},"/harshangrjn/LaplacianOpt.jl/unstar":{"post":"fGh57hkV6xtiL1O9h__RgnxBx1mfaHolofyZVDtPd05wk4yDEQBEOdootJGRzE_lJzEvfDfYD2jpRQvGNrGO4g"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"JK5zbvn4qySLe5IqmtOG8WN-M--gkdZrLOxF1ib4l_d2FWYr3VtL8v6B6cHOgxAtaBWrq0NQsJ7goMEETAj-Ww"}}},"title":"Repository search results"}