{"id":15465928,"url":"https://github.com/athityakumar/mst","last_synced_at":"2026-03-02T15:32:55.858Z","repository":{"id":71449705,"uuid":"87334628","full_name":"athityakumar/mst","owner":"athityakumar","description":"Minimum / Maximum spanning tree of a directed graph","archived":false,"fork":false,"pushed_at":"2017-04-09T10:05:39.000Z","size":174,"stargazers_count":4,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-22T11:21:36.689Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/athityakumar.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2017-04-05T16:55:07.000Z","updated_at":"2024-01-05T04:29:04.000Z","dependencies_parsed_at":"2023-06-13T12:45:14.703Z","dependency_job_id":null,"html_url":"https://github.com/athityakumar/mst","commit_stats":{"total_commits":2,"total_committers":1,"mean_commits":2.0,"dds":0.0,"last_synced_commit":"288828afb33913ab85dba8c561022df7e13522f1"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/athityakumar/mst","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/athityakumar%2Fmst","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/athityakumar%2Fmst/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/athityakumar%2Fmst/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/athityakumar%2Fmst/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/athityakumar","download_url":"https://codeload.github.com/athityakumar/mst/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/athityakumar%2Fmst/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265570991,"owners_count":23789994,"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":[],"created_at":"2024-10-02T01:04:14.689Z","updated_at":"2026-03-02T15:32:50.817Z","avatar_url":"https://github.com/athityakumar.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"### `mst.py` (Minimum Spanning Tree)\n\nThis script has been given in one of the [Stack-Overflow answers](http://stackoverflow.com/a/34407749) regarding Admund's Algorithm for finding Minimum Spanning Tree (MST) on a Directed Graph. \n\n![alt tag](outputs/mst.png)\n\n### `gen_st.py` (general Spanning Tree)\n\nI have tweaked the above `mst.py` to work as both minimum / maximum spanning tree(s) - depending on the argument given to the function, along with a few code refinements.\n\n![alt tag](outputs/gen_st.png)\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fathityakumar%2Fmst","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fathityakumar%2Fmst","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fathityakumar%2Fmst/lists"}