Prim's and Krushal's

Minimum Cost Spanning Tree

Graphs are a combinations of vertices and edges. A spanning tree is a subgraph of a graph, which all the vertices but has \(n - 1\) edges.