Lecture 10 Part 1 - Graph Problems & Dijkstra's Algorithm

📌 In This Video: Lecture 10 Part 1 Recap We're a group of students from the Faculty of Computer and Information Sciences at Ain Shams University, and we're here to make your academic journey a little easier. This channel is dedicated to helping fellow students with study guides, lecture breakdowns, and tutorials — created by students, for students. We are not an official university organization - just a passionate group of peers committed to supporting our community. 📬 Stay Connected: 🔔 Subscribe so you never miss a new upload 👍 Like the video if it helped you 💬 Comment your questions below — we read everything! 📨 Email us: [email protected] ⏱️Timestamps: 00:00:00 Intro 00:01:36 Reachability Problem 00:04:15 Connectivity Problem 00:06:52 Cycle Detection Problem 00:10:27 Graph Coloring Problem 00:18:28 Eulerien Path Problem 00:24:36 Hamiltonian Path Problem (Traveling Salesman Problem) 00:31:55 SSSP (يداية المنهج) 00:34:33 P = NP? 00:42:04 Dijkstra's Algorithm 00:44:33 Dijkstra Example 1 01:01:59 Dijkstra Example 2 01:07:49 Try yourself 01:08:23 Dijkstra's Pseudocode 01:13:24 Outro If this helped you, share it with a classmate who needs it. 🚀 #datastructures #cplusplus #programming #computerscience #coding #softwareengineering #techtutorial #learntocode #codewithme