The file DirectedGraph.cpp contains the code for defining the vertices of a directed graph. Use this file to write a program which calculates the average ASCII value of all the characters in the graph (sum all the ASCII values of the vertices in the graph, and divide them by the number of vertices in the graph). Put the weights between the vertices to be the differences (in absolute value) between the ASCII code of the starting vertex and the average ASCII value. The direction between two vertices should be determined randomly. If a character is repeated, it should not be included in the graph.
The file DirectedGraph.cpp contains the code for defining the vertices of a directed graph. Use this file to write a program which calculates the average ASCII value of all the characters in the graph (sum all the ASCII values of the vertices in the graph, and divide them by the number of vertices in the graph). Put the weights between the vertices to be the differences (in absolute value) between the ASCII code of the starting vertex and the average ASCII value. The direction between two vertices should be determined randomly. If a character is repeated, it should not be included in the graph.
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
![The file DirectedGraph.cpp contains the code for defining the vertices of a directed graph. Use this file to write a program which calculates the average ASCII value of all
the characters in the graph (sum all the ASCII values of the vertices in the graph, and divide them by the number of vertices in the graph). Put the weights between the
vertices to be the differences (in absolute value) between the ASCII code of the starting vertex and the average ASCII value. The direction between two vertices should be
determined randomly. If a character is repeated, it should not be included in the graph.
From the thus obtained directed graph create a minimum spanning tree according to Dijkstra's algorithm that starts from the vertex with the highest ASCII value in the
graph. Print the tree.
The original graph:
S: B(5> 0(5> Ü<55
R: S(5> G4> B(4> 0C4> T(4>
G: S(5>
B: G(?) UC12)
0: G(?) B(12) U<1>
T: S(5> G<7) B(12) OC1>
J: R(4) G?) T(6)
The mininal spanning tree according Dijkstra's algorithn starting at the vertex
vith the highest ASČII value 'Ų':
S:
R: G(4> B(4> T<4>
G: S(5>
B:
0:
T: 0C1>
U: R(4>](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1e74522d-f3fa-47bb-9716-552da1099769%2F28246d58-f7e5-4594-9bc2-541ae3b608ce%2Fovtkc6_processed.png&w=3840&q=75)
Transcribed Image Text:The file DirectedGraph.cpp contains the code for defining the vertices of a directed graph. Use this file to write a program which calculates the average ASCII value of all
the characters in the graph (sum all the ASCII values of the vertices in the graph, and divide them by the number of vertices in the graph). Put the weights between the
vertices to be the differences (in absolute value) between the ASCII code of the starting vertex and the average ASCII value. The direction between two vertices should be
determined randomly. If a character is repeated, it should not be included in the graph.
From the thus obtained directed graph create a minimum spanning tree according to Dijkstra's algorithm that starts from the vertex with the highest ASCII value in the
graph. Print the tree.
The original graph:
S: B(5> 0(5> Ü<55
R: S(5> G4> B(4> 0C4> T(4>
G: S(5>
B: G(?) UC12)
0: G(?) B(12) U<1>
T: S(5> G<7) B(12) OC1>
J: R(4) G?) T(6)
The mininal spanning tree according Dijkstra's algorithn starting at the vertex
vith the highest ASČII value 'Ų':
S:
R: G(4> B(4> T<4>
G: S(5>
B:
0:
T: 0C1>
U: R(4>
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.
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.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