Design and Analysis of Algorithms- Dikstra's algorithm imolementation. Note: This graph is just an example. Your...

Transcribed Image Text:

Design and Analysis of Algorithms- Dikstra's algorithm imolementation. Note: This graph is just an example. Your program must be able to input and deal with any other weighted connected graph. Example: 12 Figure 1 Please enter number of nodes in your computer network: Please enter number of links (optional) 15 Please enter the links:( vertexd, vertex2, weight) Please enter edgel: 1 Please enter edge2: 1 12 Please enter edge3: and so on until the user inputs all the edges Please enter the source node to find the shortest paths: The shortest path from 1 to 2 is: "1+2 The shortest path from 1 to 3is: "1 The shortest path from 1 to 4 is: "124 and has the length of 14 The shortest path from 1 to 5 is "125 and has the length of 13 and has the length of 8 and has the length of 12 The shortest path from 1 to 6 is: "1-36" The shortest path from I to 7 is: "127 and has the length of 15 and has the length of 14 The shortest path from 1 to 8 is: 1278 The shortest path from 1 to 9 is: "12-→749 and has the length of 21 and has the length of 18 Design and Analysis of Algorithms- Dikstra's algorithm imolementation. Note: This graph is just an example. Your program must be able to input and deal with any other weighted connected graph. Example: 12 Figure 1 Please enter number of nodes in your computer network: Please enter number of links (optional) 15 Please enter the links:( vertexd, vertex2, weight) Please enter edgel: 1 Please enter edge2: 1 12 Please enter edge3: and so on until the user inputs all the edges Please enter the source node to find the shortest paths: The shortest path from 1 to 2 is: "1+2 The shortest path from 1 to 3is: "1 The shortest path from 1 to 4 is: "124 and has the length of 14 The shortest path from 1 to 5 is "125 and has the length of 13 and has the length of 8 and has the length of 12 The shortest path from 1 to 6 is: "1-36" The shortest path from I to 7 is: "127 and has the length of 15 and has the length of 14 The shortest path from 1 to 8 is: 1278 The shortest path from 1 to 9 is: "12-→749 and has the length of 21 and has the length of 18

Answer rating: 100% (QA)

Java code for the given data The following source code for the given data Source code importing statements for importing predefined classes import javaawtEventQueue import javaawteventMouseAdapter imp... View the full answer