Please Login To Continue
Lesson-2 Concept of Singal Source Shortest Path (in Hindi)
Lesson 2 of 10 • 12 upvotes • 8:29mins
Monika Dubey
Applications of Greedy Approach and Path Finding Algorithm
(Hindi) Dijkstra's and Bellman-Ford Algorithm (Single Source Shortest Path Algorithm)
10 lessons • 1h 28m
1
Lesson-1 Concept of Greedy Approach (in Hindi)
5:42mins
2
Lesson-2 Concept of Singal Source Shortest Path (in Hindi)
8:29mins
3
Lesson-3 Dijkstra's Algorithm (in Hindi)
11:55mins
4
Lesson-4 Dijkstra's Algorithm Practice Problem (in Hindi)
10:25mins
5
Lesson-5 Trick to Solve Dijkstra's Algorithm Problem (in Hindi)
10:15mins
6
Lesson-6 Bellman–Ford Algorithm (in Hindi)
12:14mins
7
Lesson-7 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)
8:07mins
8
Lesson-8 GATE Previous Year Questions Dijkstra's Algorithm (in Hindi)
8:51mins
9
Lesson-9 GATE Previous Year Questions (in Hindi)
6:05mins
10
Lesson-10 GATE Previous Year Questions (in Hindi)
6:33mins
Crack GATE - Iconic Pro with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
