QCE Together Year 12 General Maths: Minimal Spanning Trees

#### General Maths

• Bivariate Data Analysis
• Time Series Analysis
• Growth and Decay in Sequences
• Earth Geometry and Time Zones
• Loans, Investments and Annuities
• Graphs and Networks
• Networks and Decision Mathematics
• Back to other subjects
Back to other subjects

# Minimal Spanning Trees

### Minimal spanning trees

This post will contain the following information about minimal spanning trees in QCE General Maths.

• What are ‘trees’
• What are spanning trees
• What are minimum spanning trees
• Using Prim’s and Kruskal’s algorithms to find minimum spanning trees

### What are ‘trees’?

tree is a connected graph that contains no cycles, multiple edges or loops. The following videos explain what trees are and provide examples on how to solve questions.

### What are spanning trees

spanning tree is a tree that connects all of the vertices of a graph. The following videos explain what spanning trees are and provide examples on how to solve questions.

### What is a minimum spanning tree

minimum spanning tree is a spanning tree with a minimum length. It connects all the vertices together with the minimum total weighting for the edges.

### 45,861 students have a head start...

Get exclusive QCE content & advice from our team of experts delivered weekly to your inbox!

## Here’s how we help...

### Holistic K-12 Tutoring

Attend our master-class workshops on how to ace your essays, assessments and exams!

### Comprehensive Workshops

Attend our master-class workshops on how to ace your essays, assessments and exams!

### Study, Uni, Career Mentoring

Attend our master-class workshops on how to ace your essays, assessments and exams!

### Senior School Workshops

Attend our master-class workshops on how to ace your essays, assessments and exams!

## 45,861 students have a head start...

Get exclusive study content & advice from our team of experts delivered weekly to your inbox!