subject

Consider a resource-limited variant of breadth-first search in which you can only add up to k of a vertex’s neighbors to the queue. in other 1 words, if a vertex v has k +p neighbors, then the last p vertices are left unmarked. it is as if they were not neighbors of v
(b) what is the worst-case running time of this algorithm if you use an adjacency list representation?
(c) regular bfs is guaranteed to visit all the vertices in a fully connected graph (see lecture 7 for definition). i. 5 pts draw a counter-example that shows that this guarantee does not hold for max-neighbors-bfs. ii. 5 pts briefly explain why max-neighbors-bfs will not visit some vertices in your example.
(d) extra credit: how would you need to modify maxneighbors-bfs to be able to visit all the vertices in the graph?

ansver
Answers: 3

Other questions on the subject: Computers and Technology

image
Computers and Technology, 22.06.2019 23:30, keviongardner
The next button in the review section shows the next available comment. next slide with no comment. previous comment. edited comment.
Answers: 1
image
Computers and Technology, 23.06.2019 13:30, powellmj9216
Spoons are designed to be used for: spring hammering. applying body filler. identifying high and low spots. sanding highly formed areas.
Answers: 3
image
Computers and Technology, 23.06.2019 17:00, taytay1828
What are the 12 colors of the spectrum called?
Answers: 1
image
Computers and Technology, 24.06.2019 03:30, ilovewaffles70
Auniform resource locator (url) is a formatted string of text that web browsers, email applications, and other software programs use to identify a particular resource on the internet. true false
Answers: 2
You know the right answer?
Consider a resource-limited variant of breadth-first search in which you can only add up to k of a v...

Questions in other subjects:

Konu
Mathematics, 07.09.2020 01:01
Konu
Chemistry, 07.09.2020 01:01