shortest-path-weighted-graph-Dijkstra-java

Find the shortest path between two nodes in a weighted graph based on Dijkstra algorithm

test case

            B    1     D   6
       5  .-+---------.'-------F
       .-'  |       .' |
    A.'     |2    .'   |
      `.    |   .'4    |3
       1`-. | .'       |
           `.'---------+
            C     8    E

• shortest path between A and F: [A, C, B, D, F]
• shortest path between C and F: [C, B, D, F]
• shortest path between D and A: [D, B, C, A]

Reference:

• https://www.youtube.com/watch?v=9wV1VxlfBlI