In bfs queue is used while in dfs stack is used to store vertices according to graph traversal.
2- in bfs process is done level to level (according to directed or non directed graph)
while in dfs the process is done to depth (the process of first visiting the root node and another is do far and then apply backtracking from last node to root node).
