{"id":23229023,"url":"https://github.com/mgrechanik/kruskal","last_synced_at":"2025-04-05T18:29:44.183Z","repository":{"id":227593905,"uuid":"771368284","full_name":"mgrechanik/kruskal","owner":"mgrechanik","description":"Kruskal's algorithm finds a minimum spanning tree","archived":false,"fork":false,"pushed_at":"2024-03-17T13:30:15.000Z","size":106,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-11T15:53:36.568Z","etag":null,"topics":["graph","kruskal","kruskal-mst","kruskals-algorithm","minimum-cost-subgraph","minimum-spanning-tree","mst","path-planning","search-algorithm"],"latest_commit_sha":null,"homepage":"","language":"PHP","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mgrechanik.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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}},"created_at":"2024-03-13T07:06:30.000Z","updated_at":"2024-03-14T06:57:08.000Z","dependencies_parsed_at":"2024-03-17T14:34:22.934Z","dependency_job_id":null,"html_url":"https://github.com/mgrechanik/kruskal","commit_stats":null,"previous_names":["mgrechanik/kruskal"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mgrechanik%2Fkruskal","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mgrechanik%2Fkruskal/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mgrechanik%2Fkruskal/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mgrechanik%2Fkruskal/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mgrechanik","download_url":"https://codeload.github.com/mgrechanik/kruskal/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247383051,"owners_count":20930203,"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":["graph","kruskal","kruskal-mst","kruskals-algorithm","minimum-cost-subgraph","minimum-spanning-tree","mst","path-planning","search-algorithm"],"created_at":"2024-12-19T01:15:56.048Z","updated_at":"2025-04-05T18:29:44.157Z","avatar_url":"https://github.com/mgrechanik.png","language":"PHP","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Kruskal's algorithm to find a minimum spanning tree\n\n## Demo \u003cspan id=\"demo\"\u003e\u003c/span\u003e\n\nExample of building a minimum spanning tree:\n![Example of building a minimum spanning tree with kruskal's algorithm](https://raw.githubusercontent.com/mgrechanik/kruskal/main/docs/kruskal.jpg \"Example of building a minimum spanning tree with kruskal's algorithm\")\n\n## Installing \u003cspan id=\"installing\"\u003e\u003c/span\u003e\n\n#### Installing through composer::\n\nThe preferred way to install this library is through composer.\n\nEither run\n```\ncomposer require --prefer-dist mgrechanik/kruskal\n```\n\nor add\n```\n\"mgrechanik/kruskal\" : \"~1.0.0\"\n```\nto the require section of your `composer.json`.\n\n## How to use  \u003cspan id=\"use\"\u003e\u003c/span\u003e \n\nRun the next code:\n```php\nuse mgrechanik\\kruskal\\Kruskal;\n\n$matrix = [\n    [ 0 , 263, 184, 335],\n    [263,  0 , 287, 157],\n    [184, 287,  0 , 259],\n    [335, 157, 259,  0]\n];\n$kruskal = new Kruskal($matrix);\nif ($kruskal-\u003erun()) {\n    // 1)\n    var_dump($kruskal-\u003egetMinimumSpanningTree());\n    // 2)\n    var_dump($kruskal-\u003egetDistance());\n}\n```\nWe will get:\n\n1) Spanning tree as an array of edges\n```\nArray\n(\n    [0] =\u003e Array\n        (\n            [0] =\u003e 0\n            [1] =\u003e 2\n        )\n\n    [1] =\u003e Array\n        (\n            [0] =\u003e 2\n            [1] =\u003e 3\n        )\n\n    [2] =\u003e Array\n        (\n            [0] =\u003e 1\n            [1] =\u003e 3\n        )\n\n)\n```\n\n2) Distance of all tree\n\n```\n600\n```\n\nThis code will find the next path:\n\n![minimum spanning tree](https://raw.githubusercontent.com/mgrechanik/kruskal/main/docs/democode.jpg \"minimum spanning tree\")","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmgrechanik%2Fkruskal","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmgrechanik%2Fkruskal","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmgrechanik%2Fkruskal/lists"}