This is a full lesson on the route inspection algorithm, covering:
(a) The definitions of Eulerian and Semi-Eulerian graphs
(b) The route inspection algorithm (with an example for students to work through at the same time)
© Adapting the route inspection problem for when we can start and finish at different vertices.
The lesson is 20 slides long and is provided in notebook, PPT and PDF forms.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have downloaded 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.
£0.00