18. Suppose you are doing a breadth-first search of a graph with n nodes. How large can thequeue get
問題詳情
18. Suppose you are doing a breadth-first search of a graph with n nodes. How large can thequeue get during the search? (A) n； (B) n - 1； (C)n - 2； (D) 1.