Alabama Math FM.N.A.18.c
The Standard
- FM.N.A
- Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
- FM.N.A.18
- Apply algorithms relating to minimum weight spanning trees, networks, flows, and Steiner trees.
Use Kruskal’s Algorithm and Prim’s Algorithm to determine the minimal spanning tree of a weighted graph.
2019 Alabama Course of Study: Mathematics · Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
Teacher's field guide
What This Standard Means
What Students Need to Do
- Students connect every vertex in a weighted graph with the lowest possible total edge weight. With Kruskal’s method, they consider edges from cheapest to most expensive and skip any that make a cycle. With Prim’s method, they start at one vertex and repeatedly add the cheapest edge leading outside their tree.
What Mastery Looks Like
- Students show the edges chosen by both methods and add their weights. Their tree reaches every vertex, has no cycles, and has one fewer edge than vertices. Both methods give the same minimum total.
Common Misconceptions
- Students may choose cheap edges even when they make a cycle. Some use Prim’s method to pick the cheapest edge anywhere, rather than one connected to the growing tree. Others confuse a minimum spanning tree with the shortest route between two vertices.
How to Assess It
- On an exit ticket, give vertices A, B, C, D and edges AB2, AC3, AD6, BC1, BD4, CD5. Ask students to show Kruskal’s choices, Prim’s choices starting at A, and the minimum total weight.
Lesson moves
Ways to Teach It
Give pairs cards A, B, C, D and paper strips AB2, AC3, AD6, BC1, BD4, CD5; have them build a tree using each method.
Ask why AC3 must be skipped after BC1 and AB2, then have students draw the cycle and explain it to a partner.
Run a two-round board race using the six-edge graph: teams list Kruskal’s choices, then Prim’s choices starting at A.
Give school buildings A, B, C, D cable costs AB2, AC3, AD6, BC1, BD4, CD5; students find the cheapest connected installation.
Free download
Printable FM.N.A.18.c Worksheet

A ready-to-print activity worksheet aligned to FM.N.A.18.c, with an answer key for the teacher on its own page. No account needed.
PDF, US Letter, prints cleanly in black and white.
Download the worksheetKeep exploring
Related Standards
- FM.N.A.18.b
Show that every connected graph has a minimal spanning tree.
- FM.N.A.18
Apply algorithms relating to minimum weight spanning trees, networks, flows, and Steiner trees.
- FM.N.A.20
Determine the minimum time to complete a project using algorithms to schedule tasks in order, including critical path analysis, the list-processing algorithm, a...
- FM.N.A.16.a
Identify properties of simple graphs, complete graphs, bipartite graphs, complete bipartite graphs, and trees.
Turn this exact standard into a lesson
Grade, subject, topic, and the complete standard are prefilled. Create one free, no account needed.
Also for this standard:Make a WorksheetMake a QuizMake a Sub Lesson