Executes Kruskal's algorithm to compute the Minimum Spanning Tree (MST) of a graph. # Parameters - `edges`: A vector of `Edge` instances representing all edges in the graph. - `num_vertices`: The total number of vertices in the graph. # Returns An `Option` containing a tuple with: - The total cost of the MST (usize). - A vector of edges that are included in the MST. Returns `None` if the gra
(mut edges: Vec<Edge>, num_vertices: usize)