Breadthfirst search tree If node v is discovered after u then edge uv is added to the tree We say that u is a predecessor parent of v A vertex is discovered at most once Run time ID: 660286
Download Presentation The PPT/PDF document "CSC317 1 At the same time:" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
