Programming with Python: v Implement Depth First Search (Traversal) v Implement Breadth First Traversal For the implementation: 1. Create a directed graph with 10 Vertices 2. Add arbitrary edges among vertices to satisfy the directed graph 3. Run your program and show appropriate output (Traversal order) 4. Your implementation should be fully commented Please, submit your source code and output (Screen Capture) too.

Depth First Search(DFS):

DFS is the graph traversal algorithm. It uses a stack to implement.

It is recursive in the manner and it uses backtracking.

The algorithm for dfs is as follows:

1. start
2. if a new node is found push it into the stack
3. marked the new node as visited
4. check the node has an adjacent node if yes then
   • if that node is not visited then visit and marked as visited
   • removed it from the stack if the node has no adjacent node
5. Repeat the above steps until the graph is not end

Step by stepSolved in 4 steps with 4 images