Last week I published a video showing how the algorithm for finding the minimum path between cities (Dijkstra’s algorithm) can be applied manually in a simple way, thanks to the use of the infinity table.
It may sound surprising, but many games and puzzles can be solved using this algorithm.
If you are a teacher - or simply curious - you will also find an activity with many applications and step-by-step guided theory.
This project took me about a month and a half to complete, and I truly hope it can be useful to as many people as possible.
If you like the work, subscribe to the channel: I will continue creating and sharing similar projects for free.
Video link: https://youtu.be/sGlgWl2LBFw
Activity link: https://drive.google.com/drive/folders/1OgqN13uy3FcguydjmBPNRvtMqRBy_SJr
Thank you so much,
DPM