Topic 63Mathematics (Edexcel)

Shortest Paths

Shortest Paths — Edexcel International A-Level Mathematics (Unit 11 / Decision Mathematics 1 (D1)). Covers: Dijkstra's Algorithm.

Practice questions

Dijkstra's AlgorithmSign up

be able to apply Dijkstra's algorithm to find the shortest path between two vertices of a weighted graph with non-negative edge weights, recording working values at each vertex

40 min