GitHub / Ahmad-Naveed / MST-with-Kruskals-Algorithm
Demonstrates Kruskal's algorithm to find the Minimum Spanning Tree (MST) of a weighted undirected graph. It utilises NetworkX for graph manipulation and visualisation and Union-Find data structure to efficiently handle the edge connections.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ahmad-Naveed%2FMST-with-Kruskals-Algorithm
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Jupyter Notebook
Size: 34.2 KB
Dependencies parsed at: Pending
Created at: about 1 year ago
Updated at: about 1 year ago
Pushed at: about 1 year ago
Last synced at: about 1 year ago
Topics: data-structures, kruskal, kruskals-algorithm, minimum-spanning-trees, networks, python