Consider an undirected graph G with n vertices (named 1 through n) and e edges. The graph is given in adjacency list format.

Produce n new lists, where the i-th list contains the vertices that are reachable from vertex i. Argue that your algorithm has an optimal running time (in the sense of ? notation), as a function of n and e.