Introduction to Java Programming, Seventh Edition, Y. Daniel Liang
Chapter 27 Graph Applications
1
The time complexity of the DFS algorithm is O(|E|).
A.
true
B.
false