4.3.6 Optimisation algorithms

To meet this assessment objective, you should be able to:

Understand and be able to trace Dijkstra’s shortest path algorithm. Students will not be expected to recall the steps in Dijkstra's shortest path algorithm.

Be aware of applications of shortest path algorithm.

Teacher PPT

Worksheet 1

Homework 1

Algorithms T5 Optimisation algorithms.pptx

Graph revision.pdf

Perason exedcel D shortest path worked examplesChp-02 023-043.pdf

Dijkstra's Shortest Path Algorithm | Brilliant Math & Science WikiOne algorithm for finding the shortest path from a starting node to a target node in a weighted graph is Dijkstra’s algorithm. The algorithm creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph. Dijkstra’s algorithm, published in 1959 and named after its creator Dutch computer scientist Edsger Dijkstra, can be applied on a weighted graph. The graph can either be directed or undirected. One …

Click here to go to the resource

6-algorithms-dijkstra.pptx

4.3.6 Optimisation algorithms

To meet this assessment objective, you should be able to:

KLASS GATEWAY

FIND US