Graph Data Structure | Part 6 | Breadth First Search and Traversal | BFS

preview_player
Показать описание
Chapters:
00:00 - Intro
01:10 - BFS vs DFS Visually
08:00 - Breadth First Traversal
13:05 - Code (Iterative BFS)
15:45 - Applications & Examples
19:31 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#graphs #datastructures #interview
  1. Nikhil Lohia
  2. programming
  3. tutorial
  4. education
  5. algorithm
  6. logic
Рекомендации по теме
Data structures: Introduction 0:16:43

Data structures: Introduction to graphs

Learn Graphs in 0:05:17

Learn Graphs in 5 minutes 🌐

Graph Data Structure 0:07:59

Graph Data Structure 1. Terminology and Representation (algorithms)

Graphs In Data 0:17:32

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

#033 [Data Structures] 0:22:32

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

Graph Algorithms for 2:12:19

Graph Algorithms for Technical Interviews - Full Course

Graph Introduction - 0:32:27

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

Graph Data Structure 0:13:32

Graph Data Structure | Illustrated Data Structures

TEAS 7 Math 2:12:14

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

Graph Data Structure 0:10:52

Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm

Graph Algorithms Crash 1:41:11

Graph Algorithms Crash Course (with Java)

What is a 0:08:55

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

Graph Representation part 0:13:45

Graph Representation part 01 - Edge List

Graph Data Structure 0:17:48

Graph Data Structure | Part 1 | Animations and Visuals

Algorithms Course - 6:44:40

Algorithms Course - Graph Theory Tutorial from a Google Engineer

Graph Data Structure 6:44:00

Graph Data Structure | Tutorial for Graphs in Data Structures

5.1 Graph Traversals 0:18:31

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

Graph Search Algorithms 0:10:30

Graph Search Algorithms in 100 Seconds - And Beyond with JS

Graph Data Structure 0:35:07

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

How I mastered 0:07:25

How I mastered Data Structures and Algorithms

GRAPH Data Structure 0:14:51

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

Graph Data Structure 0:29:18

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

Data structures: Properties 0:15:16

Data structures: Properties of Graphs

4 Ways to 0:00:42

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

Комментарии
Автор

Amazing explanation. Keep going like this. Don't disheartened by less views. You are gem.

utkarshsharma
Автор

You are a blessing in the world of programming sir.

introvertwhiz-llip
Автор

simple sketches, clean code, Awesome explantion.. pls dont stop!

viveksundli
Автор

Thank you sir for the wonderful explanation

tanishkaagarwal
Автор

keep it up Bro... Doing well Job... Thank you

jaydeepvasoya
Автор

I was wondering in your explanation of the BFS you add a node to the visited Set only once it's popped from the Queue which makes sense intuitively similar to DFS. However in your code explanation you mark a node as visited one line after its being added to the queue. Can you explain this and does it make a difference? Which is correct? Thanks for your comprehensive videos

skyline
Автор

the map in the video give us the idea that you are living in New York . I was thinking that you are living in India😄. Bye the way, the explaination is so clear and understandable to me.

vipulaggarwal
Автор

Why do you visited.add in the IF statement since you haven't visited the node yet, and at this point you are just checking for neighbors?

lo_sten
Автор

One question or Doubt:: You were not checking whether popped element from the queue is visited or not in the code.. without tis check you were printing ..SO there is a possibility of getting a node printed more than one time likewise in the case of example you explained before code..

unique_ruler_memes
Автор

I think it'd make a bit more clearer if you add to the visited nodes once pulled from the queue.

shenth
Автор

I'm confused, Why do we mark a node as visited as soon as we add it into the queue as oppose to while we are actually polling it in the code? in DFS we only marked a node as visited when we popped it from the stack.

InfiniteRedditEpisodes