https://github.com/athityakumar/mst

Minimum / Maximum spanning tree of a directed graph
https://github.com/athityakumar/mst

Last synced: 4 months ago
JSON representation

Minimum / Maximum spanning tree of a directed graph

• Host: GitHub
• URL: https://github.com/athityakumar/mst
• Owner: athityakumar
• Created: 2017-04-05T16:55:07.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2017-04-09T10:05:39.000Z (about 9 years ago)
• Last Synced: 2025-04-22T11:21:36.689Z (about 1 year ago)
• Language: Python
• Size: 170 KB
• Stars: 4
• Watchers: 2
• Forks: 1
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
### `mst.py` (Minimum Spanning Tree)

This 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. 

![alt tag](outputs/mst.png)

### `gen_st.py` (general Spanning Tree)

I 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.

![alt tag](outputs/gen_st.png)