HSC Together Year 12 Maths Standard: Minimum Spanning Trees

#### Maths Standard

• Simultaneous Linear Equations
• Non-linear Relationships
• Non-Right Angled Trigonometry
• Rates and Ratios
• Investments and Loans
• Annuities
• Bivariate Data Analysis
• The Normal Distribution
• Network Concepts
• Critical Path Analysis
• Back to other subjects
Back to other subjects

# Minimum Spanning Trees

This post will contain the following information about minimum spanning trees in HSC Standard Math.

### 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 the concept and completes exam-style questions,

### What is a Minimum Spanning Tree

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

### Using Prim’s and/or Kruskal’s Algorithms

##### Kruskal’s Algorithm

Want to learn more? Check out more of our HSC Standard Maths resources here!

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

Get exclusive HSC 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!

## Looking for Academic Support?

Discover how we can help you!