Twa kɔ nsɛm atitiriw so

Sign up for FREE

A2 - Dijkstra’s algorithms

Last updated about 1 year ago

2 Nsɛmmisa

Akwankyerɛ

Watch the video tutorial on Dijkstra's algorithm and and complete both tables to find the shortest paths.

5

Asemmisa {{asɛmmisaAhyɛnsode}}

1.

Using Dijkstra’s shortest path algorithm complete the table to show the shortest path from A to H.

5

Asemmisa {{asɛmmisaAhyɛnsode}}

2.

Using Dijkstra’s shortest path algorithm show the shortest path between nodes F and C.