{"id":16125599,"url":"https://github.com/semibran/graph-mst","last_synced_at":"2025-06-14T09:33:28.609Z","repository":{"id":130492037,"uuid":"123771441","full_name":"semibran/graph-mst","owner":"semibran","description":":chart_with_upwards_trend: minimum spanning tree generator","archived":false,"fork":false,"pushed_at":"2018-03-07T03:00:52.000Z","size":327,"stargazers_count":7,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-02T16:01:56.603Z","etag":null,"topics":["graph-theory","minimum-spanning-tree"],"latest_commit_sha":null,"homepage":"https://semibran.github.io/graph-mst/","language":"JavaScript","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/semibran.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}},"created_at":"2018-03-04T08:45:06.000Z","updated_at":"2023-06-17T18:00:59.000Z","dependencies_parsed_at":"2024-03-15T03:47:12.643Z","dependency_job_id":null,"html_url":"https://github.com/semibran/graph-mst","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/semibran/graph-mst","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/semibran%2Fgraph-mst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/semibran%2Fgraph-mst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/semibran%2Fgraph-mst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/semibran%2Fgraph-mst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/semibran","download_url":"https://codeload.github.com/semibran/graph-mst/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/semibran%2Fgraph-mst/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259794396,"owners_count":22912345,"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-theory","minimum-spanning-tree"],"created_at":"2024-10-09T21:30:08.116Z","updated_at":"2025-06-14T09:33:28.585Z","avatar_url":"https://github.com/semibran.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graph-mst\n\u003e generates a minimum spanning tree from a weighted graph\n\n![demo](img/demo.gif)\n\nThis module exposes the `span` function, which uses [Prim's algorithm] to generate a [minimum spanning tree] from a weighted graph.\n\n## usage\n\n### `span(graph) -\u003e tree`\nConverts a `graph` with the fields `nodes : [ x, y ]` and `edges : { endpoints : [ ...nodeIndices ], weight: Number }` to a minimum spanning tree.\n\n[Prim's algorithm]:      https://en.wikipedia.org/wiki/Prim%27s_algorithm\n[Minimum spanning tree]: https://en.wikipedia.org/wiki/Minimum_spanning_tree\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsemibran%2Fgraph-mst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsemibran%2Fgraph-mst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsemibran%2Fgraph-mst/lists"}