🌿 CS305 — GRAPH THEORY 🌏
A concise introduction to graph models, core algorithms (search, MST, shortest paths, matchings, flows), theoretical concepts and applications, with lab implementations and complexity analysis. Prerequisite: discrete mathematics and programming.
📚 Additional Lecture Drive Links
| # | Resource | Actions |
|---|---|---|
| 1 | Graph Theory | |
| 2 | Tutorial 1 | |
| 3 | Tutorial 2 | |
| 4 | Tutorial 3 | |
| 5 | Tutorial 4 | |
| 6 | Tutorial 5 | |
| 7 | Tutorial 6 | |
| 8 | A first course in graph theory by Gray | |
| 9 | Graph theory with applications by Bondy | |
| 10 | Graph Theory - Deo | |
| 11 | Lec 01 | |
| 12 | Lec 02 | |
| 13 | Lec 03 | |
| 14 | Lec 04 | |
| 15 | Lec 05 | |
| 16 | Lec 06 | |
| 17 | Lec 07 | |
| 18 | Lec 08 | |
| 19 | Lec 09 | |
| 20 | Lec 10 | |
| 21 | Lec 11 | |
| 22 | Lec 12 | |
| 23 | Lec 13 | |
| 24 | Lec 14 | |
| 25 | Lec 15 | |
| 26 | Lec 16 | |
| 27 | Lec 17 | |
| 28 | Lec 18 | |
| 29 | Lec 19 | |
| 30 | Lec 20 | |
| 31 | Lec 21 | |
| 32 | Lec 22 | |
| 33 | Lec 23 | |
| 34 | Lec 24 | |
| 35 | Lec 25 | |
| 36 | Lec 26 | |
| 37 | Lec 27 | |
| 38 | Lec 28 | |
| 39 | Lec 29 | |
| 40 | Lec 30 | |
| 41 | Lec 31 |
📑 Available Pyqs
📤 Contributing
How to add resources
Option A: Upload PDFs
CS301/
├── CS301_Mid_2024.pdf
├── CS301_End_2023.pdf
└── CS301_Notes_TopicX.pdfOption B: Add Drive Links (Recommended)
Add your Google Drive share link to the table above following the existing format.
📝 Naming Convention
- For exams:
CS301_Mid_YYYY.pdforCS301_End_YYYY.pdf - For notes:
CS301_Lecture#_Topic.pdf - For assignments:
CS301_Assignment#_YYYY.pdf
💡 Important: Only add files you have permission to share
Need help? Open an issue or contact the maintainers
