Python prims and kruskal algorithms. Both Prims and Kruskal algorithms are greedy algorithms and both use a minimum spanning tree (MST). They are greedy because they pick the smallest weighted edge ...

This program generates a graph using python and compares the timing between Kruskal's and Prim's MST algorithm - MikeCuzzo/Kruskals-Vs-Prims-MST ...