What you need to know
Check yourself against these “I can” statements.
- I can decide whether a graph is traversable by looking at the degrees of its vertices
- I can use the route inspection algorithm with up to four odd vertices
- I can find the shortest route that travels along every edge and returns to the start
These are the pages for Route inspection in the International A Level scheme of work, following Pearson Edexcel International Advanced Level Mathematics, Further Mathematics and Pure Mathematics (2018). Open this topic in Mr Wells Maths to see it alongside the rest of the course.