Question

Consider the following graph with weights. Use Dijkstra's Algorithm to identify and draw the shortest path from Point E to Point B. Show your work using the required method in order to receive credit. (Note: It is easy to find the shortest path by guessing; instead, you should use the algorithm and show work correctly). Draw on the provided graph. (or Draw a LARGE graph if you choose to draw it on your own.)

Answer 1

Using Dijkstra's Algorithm, we will find the shortest path from point E to point B

so, as shown in the figure, from E to B there are many paths we will check each one;

1. E , B = 15

2. E , F , B = 12 + 2 = 14

3. E, F , A , B = 12 + 5 + 1 = 18

4. E , F , D , A , B = 12 + 3 + 11 + 1 = 27

5. E , D , F , B = 4 + 3 + 2 = 9

6. E , D , F , A , B = 4 + 3 + 5 + 1 = 12

7. E , D , A , B = 4 + 11 + 1 = 16

So, the shortest path is the least weights

so, the shortest path is E , D , F , B