Depth-First Search (DFS) and Edge Classification
4. In DFS of a connected undirected graph G, we get only tree and back edges. No forward or cross edges. Answer as concisely and clearly as possible. Long or unstructured will not receive maximum credit.
(a) (13 points) Show by contradiction that you cannot have a Forward edge.
(b) (13 points) Show by contradiction that you cannot have a Cross edge.
Copyright By PowCoder代写 加微信 powcoder
COMP 251 – Midterm Page 9 of 10 Fall 2021
COMP 251 – Midterm Page 10 of 10 Fall 2021
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com