You are on page 1of 2

Use Djikstra’s Algorithm and Dial’s Algorithm to find the

1. shortest path; and


2. shortest minimum weight.

Graph 1.

start

Graph 2.
Graph 3:

You might also like