Please Login To Continue
Depth First Search or DFS for a Graph
Lesson 3 of 10 • 0 upvotes • 5:47mins
Rakesh Naga Chinta
Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array.
Adobe, Amazon Top 10 Algorithms in Interview Questions
10 lessons • 1h 21m
1
Top 10 Algorithms in Interview Questions: Introduction
6:31mins
2
Dynamic Programming Floyd Warshall Algorithm
10:19mins
3
Depth First Search or DFS for a Graph
5:47mins
4
Method 2 Linked List (make visited nodes)
5:47mins
5
Breadth First Search or BFS for a Graph
9:27mins
6
Boggle (Find all possible words in a Board of Characters)
8:21mins
7
Kruskal's Minimum Spanning Tree Algorithm
5:53mins
8
Given a singly Linked List and a position, delete a Linked List node at the given position
7:45mins
9
Disjoint set or (union - find) Algorithm of a Graph
10:07mins
10
Finding Bridges in a graph intro to the Algorithm
11:39mins
Crack Campus Placements with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
