What is a Minimum Spanning Tree?

A Minimum Spanning Tree is a tree only containing the edges of the minimum cost possible where you can get to every node in the tree is. The ordered tree:

• A-1-B
• B-2-E
• D-4-E
• E-4-C
• C-5-F
• A-4-D
• D-4-B
• A-3-E
• E-7-F

has two minimum spanning trees:

• A-1-B
• B-2-E
• D-4-E
• E-4-C
• C-5-F

and

• A-1-B
• B-2-E
• D-4-A
• E-4-C
• C-5-F

A picture of this is pictured below

For further reading feel free to go here.