We will be referring to the following graph in the questions below S 1 A 3 4 1 2 E I 2 2 ст 5 5 ст F 9 7 H G 6 2 4 8 B C Ꭰ Suppose we start Prim's algorithm from S on this graph. Write down the state of the Priority Queue being used as the fringe after S is visited, after B is visited, and after the algorithm is completed. Each value in the priority queue should be an integer. Resolve ties by alphabetical order of the vertices. For example: if A and C have the same priority, then you should first pop A since it comes alphabetically first. Initialize the priority of each vertex as inf which we'll use to represent ∞. So, before the first iteration, the values of the fringe are: fringe = {S:0, A:inf, B:inf, C:inf, D:inf, E:inf, F:inf, G:inf, H:inf, I:inf} Order your fringe by priority values. You should use the same alphabetical tie-breaking scheme when choosing the order of the fringe. Make sure you include the { and > in your answer. If the fringe is empty, put { }
We will be referring to the following graph in the questions below S 1 A 3 4 1 2 E I 2 2 ст 5 5 ст F 9 7 H G 6 2 4 8 B C Ꭰ Suppose we start Prim's algorithm from S on this graph. Write down the state of the Priority Queue being used as the fringe after S is visited, after B is visited, and after the algorithm is completed. Each value in the priority queue should be an integer. Resolve ties by alphabetical order of the vertices. For example: if A and C have the same priority, then you should first pop A since it comes alphabetically first. Initialize the priority of each vertex as inf which we'll use to represent ∞. So, before the first iteration, the values of the fringe are: fringe = {S:0, A:inf, B:inf, C:inf, D:inf, E:inf, F:inf, G:inf, H:inf, I:inf} Order your fringe by priority values. You should use the same alphabetical tie-breaking scheme when choosing the order of the fringe. Make sure you include the { and > in your answer. If the fringe is empty, put { }
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Give the state of the priority queue after SS is visited in the format shown above fringe:
Give the state of the priority queue after B is visited fringe:
![We will be referring to the following graph in the questions below
S
1
A
3
4
1
2
E
I
2
2
ст
5
5
ст
F
9
7
H
G
6
2
4
8
B
C
Ꭰ
Suppose we start Prim's algorithm from S on this graph. Write down the state of the Priority
Queue being used as the fringe after S is visited, after B is visited, and after the algorithm is
completed. Each value in the priority queue should be an integer. Resolve ties by alphabetical order
of the vertices. For example: if A and C have the same priority, then you should first pop A since it
comes alphabetically first.
Initialize the priority of each vertex as inf which we'll use to represent ∞. So, before the first
iteration, the values of the fringe are:
fringe = {S:0, A:inf, B:inf, C:inf, D:inf, E:inf, F:inf, G:inf, H:inf, I:inf}
Order your fringe by priority values. You should use the same alphabetical tie-breaking scheme
when choosing the order of the fringe. Make sure you include the { and > in your answer. If the
fringe is empty, put { }](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1d5e88e6-b1af-4aea-9b08-2dadd85f5e2c%2F2de928ab-7c60-44a8-815a-115128121071%2Fippdxjd_processed.png&w=3840&q=75)
Transcribed Image Text:We will be referring to the following graph in the questions below
S
1
A
3
4
1
2
E
I
2
2
ст
5
5
ст
F
9
7
H
G
6
2
4
8
B
C
Ꭰ
Suppose we start Prim's algorithm from S on this graph. Write down the state of the Priority
Queue being used as the fringe after S is visited, after B is visited, and after the algorithm is
completed. Each value in the priority queue should be an integer. Resolve ties by alphabetical order
of the vertices. For example: if A and C have the same priority, then you should first pop A since it
comes alphabetically first.
Initialize the priority of each vertex as inf which we'll use to represent ∞. So, before the first
iteration, the values of the fringe are:
fringe = {S:0, A:inf, B:inf, C:inf, D:inf, E:inf, F:inf, G:inf, H:inf, I:inf}
Order your fringe by priority values. You should use the same alphabetical tie-breaking scheme
when choosing the order of the fringe. Make sure you include the { and > in your answer. If the
fringe is empty, put { }
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education