DFS Depth First Search | Graph Traversal | Data Structure

In this video, I have explained in detail about DFS (Depth First Search). I explained the algorithm as well as the code for DFS.
Depth First Search (DFS) is an algorithm for traversing or searching tree or graph data structures. It starts with the initial node of the graph, and then goes deeper and deeper until we find the goal node or a leaf node. Then the algo backtracks from the dead end towards the most recent node that is yet to be completely unexplored.

Source Code: https://github.com/fit-coder/fitcoderyoutube/tree/master/graph

00:00 Introduction
00:08 Graph Traversals
00:29 What is DFS ?
04:30 Stack based approach
08:31 Recursive approach
10:27 Applications
13:00 C++ implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For in-depth Graph theory and implementation details, please refer to the below videos:
Graphs Introduction - https://www.youtube.com/watch?v=4xMsNIPEkwA

Graph representation:
Adjacency Matrix: https://www.youtube.com/watch?v=x6N5FK6ArRk
Adjacency List: https://www.youtube.com/watch?v=3AtEzK4sowk
Incidence Matrix: https://www.youtube.com/watch?v=bP-8P8f8mAY

Traversal techniques:
BFS, Breadth First Search: https://www.youtube.com/watch?v=iYz-pG1CPIM
DFS, Depth First Search: https://www.youtube.com/watch?v=oO1857MQlcs

Shortest Path algorithms:
Dijkstra algorithm: https://www.youtube.com/watch?v=J12sfRYpW-M
Bellman Ford algorithm: https://www.youtube.com/watch?v=iGzZEJc_w3I
Floyd Warshall algorithm: https://www.youtube.com/watch?v=R0Srbd5ALN8

Minimum Spanning Tree:
Kruskal algorithm: https://www.youtube.com/watch?v=dYIWheKq5Xc
Prim algorithm: https://www.youtube.com/watch?v=NCpUwOqt41k

Topological sort (Kahn algorithm): https://www.youtube.com/watch?v=gDNm1m3G4wo

Articulation points / Cut vertices:
Tarjan algorithm: https://www.youtube.com/watch?v=qNVNoZJFp_g

Disjoint Set / Union Find: https://www.youtube.com/watch?v=0JE7hxr8c5c

Maximum Flow Problem:
Ford Fulkerson algorithm: https://www.youtube.com/watch?v=_UcOALraATY

Graph coloring / Chromatic number: https://www.youtube.com/watch?v=oikZlz1GNbo

Hamiltonian cycle: https://www.youtube.com/watch?v=jGRRBJlNtwI

Euler cycle (Fleury algorithm): https://www.youtube.com/watch?v=c0e50JIAMuM


#DataStructure,#Graphs,#FitCoder,#Algorithm,#competitiveprogramming