Graph Data Structure | Part 5 | Depth First Search and Traversal | DFS

Показать описание

Chapters:
00:00 - Intro
00:54 - Why is graph traversal different?
04:02 - Depth First Traversal
10:03 - Code (Iterative DFS)
13:44 - Code (Recursive DFS)
16:10 - Visualizing DFS
18:15 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#graphs #datastructures #interview

Рекомендации по теме

Комментарии

You are simply super Nikhil. You make things so simple and easy to understand, no matter how complex the topic is. 👍

KoundinyaKoorapati-ov

Hi bro! I am really surprised why there are less subscribers here! Your explanation is very clear and illustration is also very good. Other sites have poor explanation but more subscribers. Hope you reach more audience soon! All the best.
You made graphs super easy for me. Thank you.

jjoelthomas

Great explanation, I'd love to know where the adjacency list was defined in the program. Many thanks

kchemutai

I like it when you said 'iterative version is better', even I like iterative better anyday 😀

RajeshS-nj

Thank you for the amazing detailed explanation!

ashok

Amazing Explanation Nikhil. Very clear and not confusing at all. Appreciate all your hard work!

krishnavadlamudi

Nikhil, you are my #1 favorite programmer on YouTube. I love your lessons! I'm so excited to review your graph data structure series!

matthewzarate

When you pop 3 (at 13:12) then you should be checking to append 2, 2 is not visited, so it would theoretically go on your stack again [2, 2]. Right?
Does this mean that when you go to pop it from the stack and add it to the set you Should be checking if the node is already in the set?

lo_sten

Why can't you use queue instead of stack?

sounaksaha

Hi bro, your really awesome in explaining solutions very understandable, keep doing brother. I have one question that was asked in coding round which I can't solve, could you please make one video regarding explaining the solution of it. Question -> swap all characters inside every prefect paranthesis. I/P = ( abcd) O/P =( dcba ), I/P = ( a(bc)d ) O/P = (d(bc)a), I/P = (a(b(cd)e)f) O/P =(f (b (dc) e) a).

saravsaro

Hi, when we code iterate version should'nt we add this before print it out.
if
continue;
Because we get duplicate. You mention in theory but neglect it in code . Am i wrong?
Great explanation btw. keep it up love your videos, really helpful, i learnt a lot from you <3

beratoztas

Graph Data Structure | Part 5 | Depth First Search and Traversal | DFS

Data structures: Introduction to graphs

Learn Graphs in 5 minutes 🌐

Graph Data Structure 1. Terminology and Representation (algorithms)

Graphs In Data Structures | Graph Representation In Data Structure | Data Structures | Simplilearn

#033 [Data Structures] - Introduction To Graph,Types Of Graph and Representation

Graph Algorithms for Technical Interviews - Full Course

Graph Introduction - Data Structures & Algorithms Tutorials In Python #12

Graph Data Structure | Illustrated Data Structures

TEAS 7 Math - ALL IN ONE Webinar - Measurement and Data - October 2024

Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm

Graph Algorithms Crash Course (with Java)

What is a Graph Data Structure? When to use it? How to easily visualize it?

Graph Representation part 01 - Edge List

Graph Data Structure | Part 1 | Animations and Visuals

Algorithms Course - Graph Theory Tutorial from a Google Engineer

Graph Data Structure | Tutorial for Graphs in Data Structures

5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

Graph Search Algorithms in 100 Seconds - And Beyond with JS

Graph Data Structure (C++ Code Implementation - Part 1) | Adjacency List Implementation

How I mastered Data Structures and Algorithms

GRAPH Data Structure | What is Graph? | DSA Course | GeeksforGeeks

Graph Data Structure Explained! (w/ Homework) [Part 1]

Data structures: Properties of Graphs

4 Ways to Represent Graph Data Structures - Edge List, Adjacency List / Matrix, Object & Pointer