https://github.com/francescobaio/kruskal
This project was undertaken as part of our Algorithms course. The primary objective of this project is to implement and analyze Kruskal's algorithm for finding the Minimum Spanning Tree (MST) in a graph. The project also explores connected components within a graph, providing a comprehensive toolkit for graph analysis.
https://github.com/francescobaio/kruskal
kruskal-algorithm mst union-find-algorithm
Last synced: about 1 month ago
JSON representation
This project was undertaken as part of our Algorithms course. The primary objective of this project is to implement and analyze Kruskal's algorithm for finding the Minimum Spanning Tree (MST) in a graph. The project also explores connected components within a graph, providing a comprehensive toolkit for graph analysis.
- Host: GitHub
- URL: https://github.com/francescobaio/kruskal
- Owner: francescobaio
- Created: 2023-02-22T18:16:37.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-06-15T15:47:19.000Z (11 months ago)
- Last Synced: 2025-02-01T15:25:44.057Z (3 months ago)
- Topics: kruskal-algorithm, mst, union-find-algorithm
- Language: Python
- Homepage:
- Size: 342 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files: