Depth First Search Explained and Implemented in Java | DFS | Graph Traversal & Theory | Geekific

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

When it comes to graph traversal, there are two main techniques that’ll immediately come to your mind: Breadth-First Search (BFS) and Depth-First Search (DFS). In this video we dive in the details and implement the Depth-First Search algorithm in both its iterative and recursive form.

Timestamps:
00:00 Introduction
00:32 Depth-First Search Explained
04:11 Implementing Depth First Search Iteratively
07:02 Implementing Depth First Search Recursively
08:08 Recap
08:57 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #DepthFirstSearch #GraphTraversal #DFS
Рекомендации по теме
Комментарии
Автор

This video have helped me more than any other DFS video. You're born to be a teacher :D
Implementation is also clean and tight, that's excellence of highest highs.
I literally no-brainer subscribed to your channel.

Many thanks!

Affliction
Автор

Dude! /Your explanations and illistrations are clear! This is the best I have seen. Thanks!

qwarlockz
Автор

Nice videos man, I have an upcoming interview in Java and I'll be relying on your channel for the revision. From one Lebanese guy to another, thank you for the great content

KarimFawaz
Автор

Wow! really clean and concise explanation. 1 more subscriber!

LucasSouza-tcwz
Автор

Recursive option with stream is lovely😊

manOfPlanetEarth
Автор

i was getting really confused trying to understand the different between bfs and dfs that i kept rewatching both videos to try and learn the concept. after just deciding to implement both and try and analyze line by line the difference, im realizing dfs uses stacks, and bfs use queues

beachwave
Автор

Thankuuu so muchhh u really deserve more 💜

RABBITTGAMING
Автор

Very informative. Thanks for sharing. Please, I have a question relating to this topic and would like to contact you. How do I reach you? Thanks

jimmyloluolajide
Автор

v0.setNeighbors(new ArrayList<>(List.of(v1, v5, v6))), ... to avoid the Exception due to immutable list :-)

emil
Автор

I cant search on github. Can you help me 🥲

Man_arulhidayat
Автор

Amazing explanation! And the way you have implemented the classes are just 🤌🏻😍

icecreamwala
Автор

I already know the material but repetition goes slowly:((((😭😭 What the heck?!🤬

manOfPlanetEarth
Автор

3:40
😂 what a funny smilie is added:)
I even feel all his amazement🤣

manOfPlanetEarth
Автор

ive always had a question in mind are u lebanese XD

mohamadjafsouniali
Автор

6:25
🤔 Why do you tend to use Arrays.asList instead of List.of?🤔
The same in BFS video.

The same in Ford-Fulkerson video: "new HashMap<>(Map.of(...))" instead of simply "Map.of(...)"🤔

manOfPlanetEarth