{"id":20409698,"url":"https://github.com/sleekpanther/kruskals-algorithm-minimum-spanning-tree-mst","last_synced_at":"2025-04-12T15:51:47.887Z","repository":{"id":115108618,"uuid":"83168162","full_name":"SleekPanther/kruskals-algorithm-minimum-spanning-tree-mst","owner":"SleekPanther","description":"Kruskal's Algorithm (greedy) to find a Minimum Spanning Tree on a graph","archived":false,"fork":false,"pushed_at":"2018-01-08T15:00:28.000Z","size":727,"stargazers_count":4,"open_issues_count":0,"forks_count":8,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-26T10:21:18.392Z","etag":null,"topics":["disjoint-sets","edges","graph","graphs","greed","greedy","greedy-algorithm","greedy-algorithms","java","kruskal-algorithm","kruskals-algorithm","minimum","minimum-spanning-trees","mst","spanning","tree","undirected","weight","weighted"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SleekPanther.png","metadata":{},"created_at":"2017-02-25T22:47:09.000Z","updated_at":"2021-07-29T17:58:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"acacc7ec-edac-4727-b7fc-36016127d70a","html_url":"https://github.com/SleekPanther/kruskals-algorithm-minimum-spanning-tree-mst","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fkruskals-algorithm-minimum-spanning-tree-mst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fkruskals-algorithm-minimum-spanning-tree-mst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fkruskals-algorithm-minimum-spanning-tree-mst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SleekPanther%2Fkruskals-algorithm-minimum-spanning-tree-mst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SleekPanther","download_url":"https://codeload.github.com/SleekPanther/kruskals-algorithm-minimum-spanning-tree-mst/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248591990,"owners_count":21130161,"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":["disjoint-sets","edges","graph","graphs","greed","greedy","greedy-algorithm","greedy-algorithms","java","kruskal-algorithm","kruskals-algorithm","minimum","minimum-spanning-trees","mst","spanning","tree","undirected","weight","weighted"],"created_at":"2024-11-15T05:43:00.247Z","updated_at":"2025-04-12T15:51:47.881Z","avatar_url":"https://github.com/SleekPanther.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fkruskals-algorithm-minimum-spanning-tree-mst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsleekpanther%2Fkruskals-algorithm-minimum-spanning-tree-mst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsleekpanther%2Fkruskals-algorithm-minimum-spanning-tree-mst/lists"}