Home
This code was made in order to showcase pathfinding on a graph.
In the world there are many things we want or need. In this world, the Pokemon World, the mission is to catch as many pokemon as possible. So Professor Boaz was sent to try and catch as many of them as he can.
The world is a bad and big, and in order to catch as any of them as he can Professor Boaz has to find the best path to catch as many pokemon as possible. But the world is complex, and has a lot of paths to take.
Implementing a path finding algorithms, Tarjan and Dijkstra, in order to find the shortest path to a Pokemon. We use the algorithm in order to find the shortest path to the pokemon and give the one of Profesor Boaz clones the correct and shortest path to that pokemon.
