How much memory does a Depth first search and a Breadth first search require in a graph with edges and vertices? psuodocode below (best and worse case space complexity).

DFS Pseudocode

Input: a graph G and a node v 

DFS (G, v): mark v 

 for each node d adjacent to v in G if d.marked = false 

DFS (G, d)

BFS Pseudocode

Input: a graph G and root v 

BFS (G, v) Q <- empty queue Q.enqueue (v) mark v while Q is not empty 

 v <- Q.dequeue () for each node d adjacent to v 

 if d.marked = false mark d 

 Q.enqueue(d)