Skip to content

Interactive Teaching Resources

Algorithm Visualizations

Browser-based demos, one algorithm at a time — step through each one, or use the editors and slides to build your own examples.

Graph Traversal

Systematic ways to visit every vertex of a graph.

Stack

Depth-First Search

Step through stack-driven graph exploration and discovery order.

Queue

Breadth-First Search

Watch queue-based layer expansion from a source vertex.

Shortest Paths

Cheapest routes through a weighted graph.

Greedy

Dijkstra's Algorithm

Track tentative distances and settled vertices in a weighted graph.

Minimum Spanning Trees

Two greedy routes to the same cheapest spanning tree.

Grow

Prim's Algorithm

Build a minimum spanning tree by growing from one component.

Merge

Kruskal's Algorithm

Sort edges, avoid cycles, and assemble an MST step by step.

Online Algorithms

Decisions made without seeing the future, measured against the offline optimum.

Competitive Analysis

The k-Server Problem

Race Greedy against Double Coverage and the offline optimum on a line.

Rent or Buy

The Ski Rental Problem

Watch the break-even rule hit its worst case of 2 − 1/B on exactly the day it buys.

Distributed & Mobile Agents

Many agents, local information, no central controller.

Search

Black Hole Search

Agents locate a node that destroys every visitor, without losing them all.

Simulation

Grid Agent Simulation

Distribute agents on a grid and step through settling and movement dynamics.

Tools & Slides

Lecture decks and an editor for building your own examples.

Slides

Graph Algorithms Lecture

Reveal.js slides with embedded visual walkthroughs.

Tool

Interactive Graph Editor

Build and style custom graphs: nodes, edges, port numbers, colors.

Slides

Schedulers Galore

Research proposal on mobile robot coordination under sequential schedulers.

Looking for the mobile-robot model simulators (CCM, LCM, SILBOT, MobileAutomata)? They live on the home page.