Graph traversals: BFS and DFS

Graph algorithms

GATE CSE · Paper 3
This syllabus version: 2027. Choose your attempt in the tracker

Open to everyone. Sign in and this lesson counts on your paper's progress.यह lesson सबके लिए खुला है। sign in करने पर यह आपके paper की progress में गिना जाता है।

4 videos
3 teachers
Length 11–160 min

Choose a teacherआप इनमें से किसी एक teacher का video चुनें। एक video काफ़ी है।

4 teachers' videos for this topic. You only need one. Nobody at YUNOVA has watched them yet; they were found by title, channel and length.

GATE Wallah CSE & DA
Algorithms 11 | Graph Traversals (Part 01) | CS & IT | GATE 2025 Crash Course
- 159 min video
- Suggested first
- Not reviewed yet
Gate Smashers
L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA
- 11 min video
- Not reviewed yet
GATE Wallah CSE & DA
GATE 2027 - ALGORITHM 18 | Graph Algorithms - BFS, DFS on Undirected Graphs | CSE & DA
- 62 min video
- Not reviewed yet
GATE CSE LECTURES BY AMIT KHURANA
BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 1
- 36 min video
- Not reviewed yet

Recommended marks a teacher on this paper's shortlist. Suggested first only means it is listed first. Neither is a verdict on the video.

by GATE Wallah CSE & DA · Not reviewed yet · Watch on YouTube · Report this video

Nobody at YUNOVA has watched these lessons yet. They were found by searching YouTube and reading each result's title, channel and length. Syllabus tracking shows what you have covered, not how ready you are; it never predicts your exam result.

Next topic: Minimum spanning trees

Topics in this chapterइस chapter के topics

Opened means you opened the lesson page. It does not mean you watched or understood it.Opened का मतलब है कि आपने lesson का page खोला। इसका मतलब यह नहीं कि आपने उसे देखा या समझा।

Next topicअगला topic

Minimum spanning trees

Next topic View topics

Back to the paperpaper पर वापस जाएँ

Pick another chapter or topic from the paper.paper में से कोई और chapter या topic चुनें।

Go to paper overview View chapters Previous topic: Divide and conquer

Source of this chapterयह chapter कहाँ से लिया गया

IIT (organising institute), GATE 2027: Computer Science and Information Technology (CS). Chapter headings are the authority's; topic lines are YUNOVA's reading order.

Report an issue with this video

YUNOVA organises freely available YouTube lessons. We do not own these videos or their content.YUNOVA, YouTube पर free मिलने वाले lessons को क्रम में रखता है। ये videos और उनकी सामग्री हमारी नहीं हैं।