graphmst
| Crates.io | graphmst |
| lib.rs | graphmst |
| version | 0.1.7 |
| created_at | 2023-04-24 03:44:40.340312+00 |
| updated_at | 2023-05-01 01:39:06.52257+00 |
| description | This crate allows you to generate minimum spanning tree from a graph using Prims, Kruskals, Boruvkas and Reverse Delete algorithms |
| homepage | |
| repository | https://github.com/kodurshravya/Secure_Programming_MST |
| max_upload_size | |
| id | 847012 |
| size | 1,820,185 |
(MWilliams5772)
documentation
README
Minimum Spanning Tree and related algorithms
- Allows users to efficiently find a Minimum Spanning Tree of a graph and use various algorithms that are related to it.
Crate Features
- Contains a custom graph structure which supports edge weights.
- Implements a reverse-delete algorithm along with Prim’s, Kruskal’s, and Borůvka’s algorithm for finding a minimum spanning tree.
- Includes any supporting algorithms.
Releases
- V1. Basic graph structure and Kruskal’s algorithm.
- V2. Prim’s algorithm
- V3. Borůvka’s algorithm
- V4. reverse-delete algorithm
Devs
- Shravya Kodur
- Ashwinkumar Ajithkumar Pillai
- Micheal Williams
- Vinaya Birajdar
Note
Test Cases are added in algo.rs file and lib.rs file