HL AI · Functions
Graph theory — adjacency matrices and walks
Nodes, edges, and the adjacency matrix A. The number of walks of length n between two nodes = (A^n) entry. HL AI Paper 3 loves this.
Practise Graph theory — adjacency matrices and walks with AI marking
Open the full HL AI engine — every question in this unit is worked through with instant AI-graded feedback on your handwritten workings.
Open HL AI Functions →
Free tools you might want