YoVDO

Dijkstra's Algorithm - Finding Single Source Shortest Path

Offered By: Sundeep Saradhi Kanthety via YouTube

Tags

Dijkstra's Algorithm Courses Graph Theory Courses Data Structures Courses Algorithm Analysis Courses Greedy Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Learn about Dijkstra's algorithm, a fundamental technique for finding the shortest path in a graph, in this 24-minute video tutorial. Explore the greedy method approach used in this algorithm to efficiently determine the single-source shortest path. Gain a deeper understanding of this important concept in the Design and Analysis of Algorithms (DAA) field. Discover how Dijkstra's algorithm works, its implementation, and its applications in solving real-world problems involving network routing and optimization.

Syllabus

DIJKSTRA ALGORITHM || FINDING SINGLE SOURCE SHORTEST PATH || GREEDY METHOD || DAA


Taught by

Sundeep Saradhi Kanthety

Related Courses

Intro to Computer Science
University of Virginia via Udacity
Design of Computer Programs
Stanford University via Udacity
Analytic Combinatorics, Part I
Princeton University via Coursera
Algorithms, Part I
Princeton University via Coursera
Algorithms, Part II
Princeton University via Coursera