🌵
Christian's Wiki
/
📖
Data Structures & Algorithms
/
Algorithm
/
Depth First Search

Depth First Search

‣
Provide a recursive implementation for DFS on a class Graph
‣
Provide an iterative implementation for DFS on a class Graph
‣
Provide a recursive implementation for DFS on an n×m Adj. matrixn \times m\ Adj.\ matrixn×m Adj. matrix
‣
Provide a iterative implementation for DFS on an n×m Adj. matrixn \times m\ Adj.\ matrixn×m Adj. matrix
‣
What are the applications of DFS?
‣
Give the space complexity of DFS
‣
Give the runtime of DFS
‣
Provide the algorithm (pseudocode) for DFS
‣
What does DFS do?