Overview
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph. It connects all the vertices together, without any cycles and with the minimum possible total edge weight.
Learning objectives
Keywords | Edge , Spanning Tree , Minimum Spanning Tree |
---|---|
Controller Required | Yes |
Languages | English - US , English - UK , 中文 , عربي |
Domain | K-12 |
Topic Code | HS300235 |
Devices | Google Cardboard , Google Daydream , Samsung Gear VR , Oculus Go , Pico , EduPro |
You were signed out of your account. Please press Reload to sign in to the Veative Console again.
Reload