Use BFS and DFS to visit all vertices of the following graph, starting from\ vertex

A

. For both algorithms, write the stack or queue contents and the\ visited or discovered set contents in all steps. For BFS, find the distances of all\ nodes from vertex

A

.

Use BFS and DFS to visit all vertices of the following graph, starting from vertex A. For both algorithms, write the stack or queue contents and the visited or discovered set contents in all steps. For BFS, find the distances of all nodes from vertex A