Represent the graph using an adjacency list , Represent the graph using an adjacency matrix ,Use DFS to traverse the graph using a stack data structure, beginning with vertex a. Write down the stack and visited vertices at each stage of the traversal and Use BFS to traverse the graph using a queue data structure beginning with the vertex a. Write down the queue and visited vertices at each stage of the traversal.

 

a b 8.0 g C Figure A e d f