This printable worksheet makes it easy to introduce the route inspection algorithm and will help your students understand how to apply the algorithm.
The first page reminds students about Eulerian and semi-Eulerian graphs, how these are the types of graphs we require to solve the route inspection problem, and then has an example where you can introduce the idea of adding/repeating arcs to create the type of graph you need.
The next page summarises the steps of the general algorithm and then the set of example questions begins. There are 14 questions in total, all with diagrams, with some requiring a closed route and some that do not. Fully worked solutions for all examples are provided.
The first page reminds students about Eulerian and semi-Eulerian graphs, how these are the types of graphs we require to solve the route inspection problem, and then has an example where you can introduce the idea of adding/repeating arcs to create the type of graph you need.
The next page summarises the steps of the general algorithm and then the set of example questions begins. There are 14 questions in total, all with diagrams, with some requiring a closed route and some that do not. Fully worked solutions for all examples are provided.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£3.00