Demonstrate the Breadth First Search (BFS) and Depth First Search (DFS) traversals for the below graph using the explicit data structure. [Show the steps]

Note: 0 is the start vertex! BFS should show the work in Queue and DFS should show the work in Stack. Please write the visited and unvisited numbers. Thank you

DATA STRUCTURES

Transcribed Image Text:

0 3 6 4 7 2 5 8 0 3 6 4 7 2 5 8