Graph Data Structure 3. Traversing a Graph (algorithms)

preview_player
Показать описание
This is the third in a series of videos about the graph data structure, including how to search a graph by systematically by visiting each and every vertex, namely, how to traverse a graph. Depth first traversal is compared with breadth first traversal, including explanations of how depth first traversal can make use of a stack data structure, and how breadth first traversal can make use of a queue data structure.
  1. Computer Science Lessons
  2. graph
  3. data structure
  4. traverse
  5. breadth first traversal
  6. depth first traversal
Рекомендации по теме
Graph Data Structure 0:06:49

Graph Data Structure 3. Traversing a Graph (algorithms)

5.1 Graph Traversals 0:18:31

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

6.2 BFS and 0:20:27

6.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures

Learn Graphs in 0:05:17

Learn Graphs in 5 minutes 🌐

Graph Algorithms for 2:12:19

Graph Algorithms for Technical Interviews - Full Course

Data structures: Introduction 0:16:43

Data structures: Introduction to graphs

Graph Search Algorithms 0:10:30

Graph Search Algorithms in 100 Seconds - And Beyond with JS

#Graph Data Structure 0:06:49

#Graph Data Structure - Part 3- Breadth First Traversal of Graphs

Learn Tree traversal 0:03:56

Learn Tree traversal in 3 minutes 🧗

Chapter 3 | 0:39:56

Chapter 3 | Graph Traversal Algorithms - #SoMEpi

Graph Data Structure 6:44:00

Graph Data Structure | Tutorial for Graphs in Data Structures

Top 5 Most 0:13:01

Top 5 Most Common Graph Algorithms for Coding Interviews

Simplest Binary Tree 0:07:15

Simplest Binary Tree Traversal trick for preorder inorder postorder

Graph Traversal In 0:15:20

Graph Traversal In Data Structures | Breadth First Search &Depth First Search Tutorial | Simplil...

6.3 Graphs Traversal 0:44:01

6.3 Graphs Traversal | Data Structures & Algorithm

5.14 Graph Data 0:06:01

5.14 Graph Data Structure : DFS traversal using Recursion

Graphs In Data 0:17:32

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

AQA A’Level Graphs 0:09:52

AQA A’Level Graphs traversal algorithms

Graph Introduction - 0:32:27

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

Lec-56: Preorder, Inorder 0:06:47

Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick

Graph Traversal techniques 0:23:18

Graph Traversal techniques - Breadth First (BFS) vs Depth First (DFS)

Algorithms Course - 6:44:40

Algorithms Course - Graph Theory Tutorial from a Google Engineer

G-5. Breadth-First Search 0:19:39

G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs

Graph Data Structure 0:19:25

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

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

I hadn't noticed queues and stacks role in traversing graphs. Thanks a lot for the video!

fatihsaidduran
Автор

Wow! Salute you Sir!! You're a great teacher!! I had never come across one in my life yet that could teach complex subjects in simple terms like the way you did!!

sckishore
Автор

The explanation was so simple and easy to understand! Thank you very much!!

hoppingturtles
Автор

Amazingly Explained. This video needs more views.

Lyaz
Автор

Thank you for the video! Your explanations and visualizations are concise and helpful.

SauerkrautHead
Автор

This channel has amazing content, it's insane. Gracias :)

diegomelogaiero
Автор

It is not declared, but you assumed that from the current vertex, the next vertex to visit, among the candidates, is the one having the nearest letter from the current letter in an alphabetical order. - For example: in DFS, from A, the next vertex chosen is B, and not C or D, because B is the nearest to the letter A. - If we take instead the farthest, in alphabetical order, from the current letter starting from A, we should have: A, D, G, H, C, F, I, B, E.

caver