📄️ Kruskal's Algorithm
Kruskal's algorithm finds the minimum spanning forest of an undirected edge-weighted graph. If the graph is connected,
📄️ Prim's Algorithm
Prim's algorithm computes the minimum spanning tree (MST) of a connected, undirected graph with weighted edges. Starting