The Muddy City: Minimal Spanning Trees


Source Institutions

Source Institutions

Add to list Go to activity
Activity link broken? See if it's at the internet archive
In this puzzle, learners investigate the decisions involved in linking a network between houses in a muddy city. It can lead on to a discussion of minimal spanning tree algorithms for optimizing networks. Additional activities, background information, and solutions are included, beginning on page 4 of the PDF.

Quick Guide


Preparation Time:
Under 5 minutes

Learning Time:
30 to 45 minutes

Estimated Materials Cost:
1 cent - $1 per student

Age Range:
Ages 8 - 18

Resource Types:
Activity, Lesson/Lesson Plan, Simulation

Language:
English, French, Italian, Portuguese

Materials List (per student)


Subjects


  • Engineering and Technology
    • Computing
      • Computer Science
      • Information Systems
    • Engineering
      • Computer Engineering
      • Transportation Engineering
    • Technology
      • Information and Communication
      • Transportation
      • Construction
  • Mathematics
    • Geometry
      • Plane Geometry
    • Number and Operations
      • Number Systems
    • Representation
  • The Nature of Technology
    • Technology and Society
      • Impacts of Technology

Informal Categories


  • Computers
  • Transportation

Audience


To use this activity, learners need to:

  • see
  • read
  • touch

Learning styles supported:

  • Uses STEM to solve real-world problems
  • Involves hands-on or lab activities

Other


Foreign language versions of this resource:

Components that are part of this resource:

Includes alignment to state and/or national standards:

This resource is part of:

Access Rights:

  • Free access

By:

  • Bell, Tim ; Witten, Ian ; Fellows, Mike ; Adams, Robyn ; McKenzie, Jane

Rights:

Funding Sources:

  • Brian Mason Scientific and Technical Trust
  • Google Inc.