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

Can edge list
E
be omitted from the adjacency matrix representation while

still achieving the time bounds given in Table 14.1? Why or why not?

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?

In order to verify that all of its nontree edges are back edges, redraw the

graph from Figure 14.8b so that the DFS tree edges are drawn with solid

lines and oriented downward, as in a standard portrayal of a tree, and with

all nontree edges drawn using dashed lines.