未分类题

无向图G=(V, E),其中:V={a, b, c, d, e, f}, E={(a, b), (a, e), (a, c), (b, e), (c, f), (f, d), (e, d)},对该图进行深度优先遍历(优先访问编号小的结点),得到的顶点序列为? 注意:答案中没有空格 Undirected G = (V,E), concretely: V = {a,b,c,d,e,f}, E = {(a,b),(a,e),(a,c),(b,e),(c,f),(f,d),(e,d)},perform depth-first traversal(visit the vertex of small number firstly), what vertices sequence do we get? Notice: no blank space in answer.

【参考答案】

按照深度优先遍历的规则,我们从编号最小的顶点开始访问,并且尽可能深入地访问每个分支,直到无法继续为止,然后回溯到上一个分......

(↓↓↓ 点击下方‘点击查看答案’看完整答案、解析 ↓↓↓)