Draw the following graph with the edge values. Start Vertex = 0 and all the edges value are from JUBAIRKHAN array's index
Suppose you are given a character array which is named as "JUBAIRKHAN". Array size is 10 and you have to fill up the values in following the example given below. For example, let's assume your full name is "JUBAIR KHAN" (All Capital).
Now fill up the array with the ASCII values of the characters of your name without any space. Write your Full Name in all Capital Characters and fill up this "JUBAIRKHAN" array .
index: 0 1 2 3 4 5 6 7 8 9
value: J U B A I R K H A N
ascii : 74,85,66,65,73,82,75,72,65,78
Use the "JUBAIRKHAN" array's ASCII values to solve the following problem.
Draw the following graph with the edge values. Start Vertex = 0 and all the edges value are from JUBAIRKHAN array's index.
Show simulations for each step and find the single source shortest path using Dijkstra's
Subject: C++ Programming
![Start Vertex
fullName[0]
fulIName(7)
fulIName[8)
fullName(3)
fulIName(6]
fulIName(s)
fullName(1]
fullName[2)
fulINme(4]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F658a9dca-0988-4aa0-8e41-55325ad5c4cd%2F3ad2cbfb-913d-4766-92a7-0effe176958d%2Fmbod5t8_processed.png&w=3840&q=75)
Step by step
Solved in 2 steps with 2 images
