In-Class Algorithms — Network Planarity Party

~22 min total

Aim of the assignment:

In this exercise you will learn about network layout readability criteria, especially edge crossing minimization. You will work in teams to eliminate edge crossings from several node-link network visualizations. You will do this using Planarity Party, a puzzle game we created that will let you connect with your group members and work to solve the puzzle together.

Your goal is to solve as many puzzles as possible within 15 minutes.

Background information:

A planar graph is a graph that can be drawn with no edge crossings. However, actually drawing the graph quickly but with no edge crossings can be a challenging algorithmic task.

Instructions:

  1. (2 min) Setup
  2. (15 min) Start solving puzzles!
  3. (1 min) When the time is up, return to our Zoom classroom.

Wrap up:

  1. (4 min) We will discuss the exercise as a class.

Troubleshooting:

Unfortunately, Planarity Party is a research demo and can be a bit finicky. If you have any problems: