Consider the graph at right. [a] [b] [c] In what order are the vertices visited using...

 

Transcribed Image Text:

Consider the graph at right. [a] [b] [c] In what order are the vertices visited using DFS starting from vertex a? Where a choice exists, use alphabetical order. What if you use BFS? A vertex x is "finished" when the recursive call DFS (x) terminates. In what order are the vertices finished? (This is different from the order in which they are visited, when DFS () is called.) In what order are edges added to the minimum spanning tree by Kruskal's algorithm? List the edges by giving their endpoints. e f 17 15 391 a---c g---h 7 9 11 /5 12 b------i 14 Consider the graph at right. [a] [b] [c] In what order are the vertices visited using DFS starting from vertex a? Where a choice exists, use alphabetical order. What if you use BFS? A vertex x is "finished" when the recursive call DFS (x) terminates. In what order are the vertices finished? (This is different from the order in which they are visited, when DFS () is called.) In what order are edges added to the minimum spanning tree by Kruskal's algorithm? List the edges by giving their endpoints. e f 17 15 391 a---c g---h 7 9 11 /5 12 b------i 14