Minimum Spanning Tree

  • (0 ratings)

Minimum Spanning Tree

Description

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

After completing this module, you will be able to:
 - Define a tree.
 - Define minimum spanning tree.
Keywords
Edge Spanning Tree Minimum Spanning Tree

Reviews

Average Rating:
0.0
Average Rating is 0.0 star(s)
Free VR Apps

Meta Data

Controller Required Yes
Languages English - US English - International 中文 عربى
Domain STEM
Topic Code HS300235
Devices Google Cardboard Google Daydream Samsung Gear VR Oculus Go Pico
#Level 3
#Question 14
  • NGSS - High School - Mathematics
  • CAPS - FET phase - Grade 10 - Mathematics
  • Egypt - Grade 12 - Mathematics
  • المملكة العربية السعودية - الصف 10 - رياضيات
  • Jordan - Grade 12 - Mathematics
  • Cambridge - O Level - Mathematics
  • Universal Content Library - High School - Mathematics