Minimum Spanning Trees

• Minimum spanning trees connect weighted graphs with the minimum possible total edge weight
• Prim's algorithm and Kruskal's algorithm are used to create a minimum spanning tree from a weighted graph
• Both of these algorithms are considered 'greedy'

Example of a minimum spanning tree:

Link for more info