[单选题]Run breadth-first search (BFS) and depth-first search (DFS) respectively on the same undirected graph, the numbers of TREE edges satisfy: 对同一个无向图分别运行广度优先算法和深度优先算法，得到的树边数量：Ewe答案窝(daanwo.com)-大学生作业答案及考资分享平台
ABFS results in more TREE edges广度优先的树边更多Ewe答案窝(daanwo.com)-大学生作业答案及考资分享平台
BDFS results in more TREE edges深度优先的树边更多Ewe答案窝(daanwo.com)-大学生作业答案及考资分享平台
Cthey result in same number of TREE edges两种算法得到的树边一样多Ewe答案窝(daanwo.com)-大学生作业答案及考资分享平台
Duncertainty in quantitative relationship数量关系不确定