Menu
Sign up Sign in

AI HL · AHL 1

Graph Theory

About this unit

Graphs, trees, algorithms, adjacency matrices and optimisation problems.

AHL 1 · 2 weeks

Sections in this unit

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