Network Flow Matching

Folder	What it is
assignment-4-flight-pilot-matching/	An Edmonds-Karp max-flow solver for a flight/pilot assignment feasibility problem.

This is the only assignment in this repo — I only found local records of Assignment 4 for this course; Assignments 1–3 weren't kept locally (or weren't part of this offering).

🎓 Project Context

Built as part of CSC 226: Algorithms and Data Structures II at the University of Victoria.

⚠️ Academic Integrity Notice

This repository is maintained for portfolio and educational purposes only. If you are currently enrolled in CSC 226 at the University of Victoria or a similar algorithms course, please note that using this code in your own assignments may constitute a violation of Academic Integrity policies.