Alabama Math FM.N.A.18

MathGrades 9–12Networks

Standard Cluster

FM.N.A
Complex problems can be modeled using vertex and edge graphs and characteristics of the different structures are used to find solutions.
Apply algorithms relating to minimum weight spanning trees, networks, flows, and Steiner trees. a. Use shortest path techniques to find optimal shipping routes. b. Show that every connected graph has a minimal spanning tree. c. Use Kruskal’s Algorithm and Prim’s Algorithm to determine the minimal spanning tree of a weighted graph.

2019 Alabama Course of Study: Mathematics

Cluster contents

Standards in This Cluster

FM.N.A.18 is a cluster heading. These are the individual standards under it.

Teacher's field guide

What This Cluster Means

What Students Need to Do

Students find the cheapest shipping route between two stops. They use Kruskal’s and Prim’s algorithms to connect every stop at the lowest total cost and explain why a minimum spanning tree exists. They also check how much a network can carry and whether an extra junction could lower the cost.

What Mastery Looks Like

A student finds a shortest route without confusing it with a tree that connects every stop. They run Prim’s and Kruskal’s algorithms and get the same minimum total weight. They show that removing cycle edges preserves connectivity, leaving a spanning tree.

Common Misconceptions

Students may choose the shortest route between two stops and call it the minimum spanning tree. They may add an edge that makes a cycle because it has a low weight, or think a junction must be one of the original stops.

How to Assess It

Exit ticket: Given edges AB 1, BC 1, CD 1, and AD 2, find the cheapest A-to-D route and use Kruskal’s algorithm to find the minimum spanning tree. Explain why the tree does not include the cheapest A-to-D route.

Lesson moves

Ways to Teach It

  1. Mark three towns on paper and connect them with string; add a junction between them and compare the total string lengths.

  2. On a connected five-dot graph, cross out cycle edges; explain why the graph stays connected and why repeating this leaves a tree.

  3. Race on edges AB 2, AC 4, BC 1, BD 5, CD 3: one partner runs Prim, the other Kruskal; compare totals.

  4. Label roads on a four-stop delivery map with travel times and truck limits; find the fastest trip and the road that limits daily deliveries.

Free download

Printable FM.N.A.18 Worksheet

Preview of the FM.N.A.18 printable worksheet

A ready-to-print activity worksheet aligned to FM.N.A.18, 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 worksheet

Keep exploring

Related Standards

Turn this cluster into a lesson

Grade, subject, topic, and the complete cluster are prefilled. Create one free, no account needed.

Also for this cluster:Make a WorksheetMake a QuizMake a Sub Lesson