One-to-One Grinds
If you feel that you would not be confident if this topic appeared on your exam, we recommend booking one of our one-to-one grinds!
Overview
\[\,\]
The length of time that we recommend members of each team spend on this topic are as follows:
\[\,\]
Alpha – 8 days
Bravo – 6 days
Charlie – 5 days
Delta – 4 days
Echo – 3 days
\[\,\]
Happy learning!
\[\,\]
Learning Objectives
State what is meant by a tree
State what is meant by a spanning tree
Find all of the spanning trees of a given network
State what is meant by a minimum spanning tree
Find the minimum spanning tree(s) of a network using Kruskal’s Algorithm
Find the minimum spanning tree(s) of a network using Prim’s Algorithm
Find the distance matrix for a given network and vice versa
Find the minimum spanning tree(s) of a network using a given distance matrix
Describe when each minimum spanning tree algorithm should be used
\[\,\]
Keywords
tree
spanning tree
minimum spanning tree
Kruskal’s Algorithm
Prim’s Algorithm
distance matrix
sparse network
dense network
\[\,\]
