Fundamental Algorithms: Design and Analysis

Fundamental Algorithms: Design and Analysis. Instructor: Prof. Sourav Mukhopadhyay, Department of Electrical Engineering, IIT Kharagpur. This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. (from

Lecture 17 - Breadth First Search (BFS) and Depth First Search (DFS)

Go to the Course Home or watch other lectures:

Lecture 01 - Insertion Sort and Asymptotic Analysis
Lecture 02 - Solving Recurrences
Lecture 03 - Divide and Conquer Paradigm
Lecture 04 - Quick Sort
Lecture 05 - Heap Sort
Lecture 06 - Decision Tree
Lecture 07 - Linear Time Sorting
Lecture 08 - Order Statistics
Lecture 09 - Hashing
Lecture 10 - Universal Hashing, Binary Search Tree Sort
Lecture 11 - Red-Black Tree
Lecture 12 - Augmenting Data Structure
Lecture 13 - Computational Geometry
Lecture 14 - Van Emde Boas Data Structure
Lecture 15 - Dynamic Programming
Lecture 16 - Graph Algorithm
Lecture 17 - Breadth First Search (BFS) and Depth First Search (DFS)
Lecture 18 - Dijkstra's Algorithm
Lecture 19 - Bellman Ford Algorithm
Lecture 20 - Floyd Warshall Algorithm