Homework 11: Graphs and Shortest Path

Model a set of relationships as a graph and find your way through it. You will represent nodes and edges with dictionaries, traverse neighbors, implement breadth-first search with a queue, and reconstruct the shortest path between two points — the core machinery behind routing, recommendation, and network analysis.

Related session: Session 12 — Graphs and Shortest Path

Topics Covered

• Graphs as a model of relationships: nodes, edges, directed and weighted variants
• Adjacency representations and their tradeoffs
• Representing a graph with dictionaries
• Neighbor traversal and breadth-first search with a queue
• Shortest-path intuition and reconstructing a path

Instructions

The detailed tasks, starter notebook, and submission instructions for this assignment have not been posted yet. Please check back after the November 11 session.