{"id":28940506,"url":"https://github.com/milosz275/minimum-spanning-tree","last_synced_at":"2025-06-23T01:11:23.673Z","repository":{"id":299898137,"uuid":"997947120","full_name":"milosz275/minimum-spanning-tree","owner":"milosz275","description":"Minimum spanning tree solver implemented using CPLEX in C++ and CDT for visualization.","archived":false,"fork":false,"pushed_at":"2025-06-07T14:53:35.000Z","size":284,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-06-18T22:11:30.711Z","etag":null,"topics":["cplex-optimization-solver","integer-linear-programming","minimum-spanning-tree","subset-construction"],"latest_commit_sha":null,"homepage":"https://milosz275.github.io/minimum-spanning-tree","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/milosz275.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-06-07T14:40:44.000Z","updated_at":"2025-06-08T09:19:53.000Z","dependencies_parsed_at":"2025-06-18T22:11:32.507Z","dependency_job_id":"4495ca33-db0c-438c-b41e-e603bf62335a","html_url":"https://github.com/milosz275/minimum-spanning-tree","commit_stats":null,"previous_names":["milosz275/minimum-spanning-tree"],"tags_count":1,"template":false,"template_full_name":"milosz275/graph-solvers-template","purl":"pkg:github/milosz275/minimum-spanning-tree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/milosz275%2Fminimum-spanning-tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/milosz275%2Fminimum-spanning-tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/milosz275%2Fminimum-spanning-tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/milosz275%2Fminimum-spanning-tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/milosz275","download_url":"https://codeload.github.com/milosz275/minimum-spanning-tree/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/milosz275%2Fminimum-spanning-tree/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261392178,"owners_count":23151721,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cplex-optimization-solver","integer-linear-programming","minimum-spanning-tree","subset-construction"],"created_at":"2025-06-23T01:10:58.430Z","updated_at":"2025-06-23T01:11:18.661Z","avatar_url":"https://github.com/milosz275.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmilosz275%2Fminimum-spanning-tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmilosz275%2Fminimum-spanning-tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmilosz275%2Fminimum-spanning-tree/lists"}