Dijkastra Algorithm

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/algorithms/shortest-path-algos/dijkstras-algorithm/asset-dijkastra-algorithm after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. DataBase Management System/DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics
  10. Theory Of Computation/Automata Theory: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  11. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the Single Source Shortest Path problem in graph theory, specifically focusing on Dijkstra's Algorithm. The instructor begins by defining the problem as finding a path between two vertices that minimizes the sum of edge weights. He then introduces Dijkstra's Algorithm, noting its historical context and its application in finding optimal paths in networks like road systems. The core of the lecture involves a step-by-step breakdown of the algorithm's pseudocode, including initialization and relaxation procedures. Finally, the instructor performs a comprehensive walkthrough on a sample graph, demonstrating how to update distance tables and reconstruct the shortest path using parent pointers.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture begins with the title "Single Source Shortest Path" displayed at the top of the slide. The text defines the problem: "finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized." The instructor draws a red circle labeled 'S' and sketches multiple red lines radiating from it to represent edges, visually explaining the concept of a single source node connecting to other nodes in a graph structure.

  2. 2:00 – 5:00 02:00-05:00

    The slide changes to "Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm)". It includes a photo of computer scientist Edsger W. Dijkstra and text stating it was "conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later." The instructor explains that this algorithm is used for finding shortest paths between nodes in a graph, which may represent road networks, and guarantees an optimal solution in a connected graph with positive weights.

  3. 5:00 – 10:00 05:00-10:00

    The instructor displays the pseudocode for `Dijkstra algorithm (G, W, S)`, `Initialize_Single_Source (G, S)`, and `Relax (u, v, w)`. He then starts a detailed walkthrough on a directed graph with nodes P, Q, R, S, T, U. He draws a table with columns for P, Q, R, S, T, U and rows for `key` (distance) and `π` (parent). He initializes P's key to 0 and others to infinity. He selects P, relaxes edges to Q (weight 1), S (weight 6), and T (weight 7), updating the table accordingly. He then selects Q and relaxes edges to R (weight 1) and S (weight 4), updating S's distance to 5.

  4. 10:00 – 10:22 10:00-10:22

    The walkthrough concludes with the final updates to the table. The instructor highlights the path P -> Q -> R -> S on the graph in red ink. He writes the final distances in the table: P=0, Q=1, R=2, S=4, T=7, U=3. He traces the path P -> Q -> R -> S, showing how the parent pointers reconstruct the shortest path from the source P to the destination S, confirming the algorithm's correctness on the example graph.

The video effectively bridges theoretical definitions with practical application. It moves from the abstract problem statement to the specific algorithmic steps, providing a clear visual aid through the graph walkthrough. The step-by-step table updates are crucial for understanding how Dijkstra's algorithm greedily selects the next closest node and updates neighbors, ensuring the shortest path is found efficiently. The final path reconstruction demonstrates how the parent pointers stored during relaxation allow for the recovery of the actual path, not just the distance.

Loading lesson…