DFS on Graph
Algo Monster
Evaluator
Monster Core
Binary SearchDFS on TreeBacktrackingBFS on TreeGraphDFS on GraphBFS on GraphTwo PointersPriority Queue/Heap
Monster Plus
Dynamic ProgrammingDivide and Conquer
Cheat sheets
Keyword to AlgorithmRuntime to AlgorithmTypes of Dynamic Programming
FAANG Question Bank
Amazon Online Assessment 2020Microsoft Online Assessment 2020
Premium
My StatsLog In

Your Progress

You current level is Student
0%
Full Statistics
Loading....
Stuck? Discuss

DFS on graphs

Prereq: Graph Intro

First slide
First slide
First slide
First slide
First slide
First slide
First slide
First slide
First slide
First slide
PreviousNext

Similar to BFS, we just have to add visited to keep track of visited nodes and use get_neighbors to get the next nodes to visit.

Loading full content...
Join our community on DiscordGo Premium