W5_L2: Single source shortest paths | dijkstra's algorithm)

Welcome to Week 5 Lecture 2 of the course "Programming, Data Structures and Algorithms using Python" by Prof. Madhavan Mukund. Full Course: https://study.iitm.ac.in/ds/course_pages/BSCS2002.html Video Overview This lecture introduces Dijkstra’s Algorithm, a greedy approach for solving the single-source shortest path problem in weighted graphs with non-negative edge weights. Through an intuitive fire propagation analogy, we develop a clear understanding of how the algorithm progressively determines the shortest distance from a starting vertex to all others. The lecture demonstrates detailed Python implementations of Dijkstra’s Algorithm using both adjacency matrices and adjacency lists, illustrating how data structure choice affects efficiency. We also analyze the computational complexity of each approach and discuss practical trade-offs in real-world applications of shortest path algorithms. About IIT Madras' online Bachelor of Science programme IIT Madras offers four-year BS programmes that aim to provide quality education to all, irrespective of age, educational background, or location. The BS programme has multiple levels, which provide flexibility to students to exit at any of these levels. Depending on the courses completed and credits earned, the learner can receive a foundation certificate from IITM CODE (Centre for Outreach and Digital Education), diploma(s) from IIT Madras, or BSc/BS degrees from IIT Madras. For more details, Visit: https://www.iitm.ac.in/academics/study-at-iitm/non-campus-bs-programmes #ShortestPath #WeightedGraphs #DijkstraAlgorithm #SingleSourceShortestPath #GraphAlgorithms #GreedyAlgorithm #DataStructures #Algorithms #ComputerScience #AdjacencyMatrix #AdjacencyList #Python #GraphTheory #NonNegativeWeights #GraphTraversal #AlgorithmDesign #IITMadras #DataStructuresAndAlgorithms #PythonProgramming