CPSC 320 Notes Markdown notes for CPSC 320 - taken in 2017W2 Table of contents (click to follow to the github page for each chapter): 1: Introduction - Some Representative Problems 1.1 A First Problem - Stable Matching 1.2 Five Representative Problems 3: Graphs 3.1. Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal Using Queues and Stacks 3.4 Testing Bipartiteness - An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering