Module dsalgo::minimum_spanning_tree_prim_dense

source ·

Functions

mst_prim_dense
return edges list (u, v), u < v the algorithm start from vertex 0. O(V^2)