Minimum spanning tree (MST)
Given an undirected weighted graph G = (V, E),
MST is given by V, subset of E such that |E| = |V| - 1, and V connects all edges.
Given an undirected weighted graph G = (V, E),
MST is given by V, subset of E such that |E| = |V| - 1, and V connects all edges.