This preview shows page 1. Sign up to view the full content.
Unformatted text preview: To break ties on which node to visit first, use alphabetical ordering. State the order in which the vertices are visited. 5. Do the following problems for BFS with enhancements. a. Perform BFS with enhancements, starting from vertex A, on the graph in figure 9.83. To break ties on which node to visit first, use alphabetical ordering. State the order in which the vertices are visited and give the contents of the queue after each visit. b. Give an example of a 3node DAG where BFS with enhancements reduces the number of nodes placed in the queue....
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details