1. Can edge list E be omitted from the adjacency list representation while still achieving the time bounds given in Table 14.3? Why or why not? 2. Explain why the DFS traversal runs in O(n2) time on...

1. Can edge list E be omitted from the adjacency list representation while still achieving the time bounds given in Table 14.3? Why or why not?

2. Explain why the DFS traversal runs in O(n2) time on an n-vertex simple graph that is represented with the adjacency matrix structure.

May 26, 2022