We have a connected graph G = ( V , E ), and a specific vertex u
Fantastic news! We've Found the answer you've been seeking!
Question:
We have a connected graph G = (V,E), and a specific vertex u ∈V. Suppose we compute a depth-first search tree rooted at u, and obtain a treeT that includes all nodes of G. Suppose we then compute a breadth-first search tree rooted at u, and obtain the same tree T. Prove that G =T. (In other words, if T is both a depth-first search tree and a breadth-first search tree rooted at u, then G cannot contain any edges that do not belong toT.)
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: