This is a ready to teach lesson on Floyd’s Algorithm, covering:
How to implement the algorithm (with an example for students to work through at the same time as you go through it on the board).
How to find the shortest route
How to find the order of the algorithm
The lesson is 57 PPT slides long, with one example for students and one question (with solutions provided).
If you have any suggestions or complaints about this resource, or a request for other resources, do not hesitate to contact me via firstname.lastname@example.org.
Chris @ Last Minute Maths