About this unit
Graphs, trees, algorithms, adjacency matrices and optimisation problems.
Sections in this unit
- AHL 1.1 What is a graph? Vertices, edges and trees 0 of 2 skills
- AHL 1.2 Adjacency matrices and degree 0 of 5 skills
- AHL 1.3 Walks, trails, paths, circuits and cycles 0 of 2 skills
- AHL 1.4 Counting walks with powers of the adjacency matrix 0 of 5 skills
- AHL 1.5 Eulerian and Hamiltonian graphs 0 of 4 skills
- AHL 1.6 Weighted graphs and shortest routes 0 of 5 skills
- AHL 1.7 Random walks, transition matrices and page rank 0 of 5 skills
- AHL 1.8 Minimum spanning trees: Kruskal's algorithm 0 of 3 skills
- AHL 1.9 Minimum spanning trees: Prim's algorithm 0 of 2 skills
- AHL 1.10 The Chinese postman problem 0 of 3 skills
- AHL 1.11 The travelling salesman: nearest neighbour 0 of 3 skills
- AHL 1.12 Travelling salesman: bounds and practical problems 0 of 4 skills
- AHL 1.13 Exam practice: the whole unit No quizzes yet
- AHL 1.14 Unit review No quizzes yet