Dijkstra Algorithm 2

Write a program in Java where you:

Use Dijkstra's algorithm to implement a program that computes the shortest distance between two nodes of an undirected weighted graph. Once Dijsktras algorithm has executed, use its output to automatically identify a shortest path in the graph.

Input:

  • The graph, given by providing in sequence: the number of nodes, then a sequence of arcs with associated length.
  • The source.
  • The destination.

Output:

  • The shortest distance.
  • A shortest path.
Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.