Make a graph of unique capital letters of your Name then applied Floyd algorithm to find...

 

Transcribed Image Text:

Make a graph of unique capital letters of your Name then applied Floyd algorithm to find the last matrix. (Note: If your Name is too long, then chose only six unique letters). Edge weight between two Nodes is the difference of ASCII table values of that letters. Suppose there is a Node 'A' and 'B'. ASCII value of A=65 and B=66, difference of B-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1s Node connected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1* and 2nd node. E.g. If your Name is "USMAN ALI" then initially node of graph look like this. ASCII value of U=85 and S=83 then edge weight between U and S is 85-83=2. Similarly make your name graph and calculate all other edges value and then applied Floyd Algorithm. Make a graph of unique capital letters of your Name then applied Floyd algorithm to find the last matrix. (Note: If your Name is too long, then chose only six unique letters). Edge weight between two Nodes is the difference of ASCII table values of that letters. Suppose there is a Node 'A' and 'B'. ASCII value of A=65 and B=66, difference of B-A=1 (66-65=1). Every node is connected to next two node through edges i.e. 1s Node connected with 2nd and 3rd node. Similarly 6th (last) node connected back to 1* and 2nd node. E.g. If your Name is "USMAN ALI" then initially node of graph look like this. ASCII value of U=85 and S=83 then edge weight between U and S is 85-83=2. Similarly make your name graph and calculate all other edges value and then applied Floyd Algorithm.

Answer rating: 100% (QA)

Step 1 St... View the full answer