Question

Which of the following is not true of depth­first search (DFS) starting at a vertex v?

A). DFS identifies all vertices reachable from v.
B). Using an adjacency list instead of an adjacency matrix can improve the worst
case complexity.
C). DFS numbering can be used to identify cycles in the graph.
D). DFS will identify the shortest paths from v in any graph without edge weights.

Answer 1

B). using an adjacency list instead of an adjacency matrix can improve the worst case complexity.