BFS algorithm to find shortest path.Define a Class Graph to store all the Vertices and Edges and to find the shortest length to exit
Budget: $10 – $30 USD
One competition in the TT is to get out of a labyrinth as quickly as possible. Your task as the tournament supervisor is:
given the labyrinth map, initial positions of the three competing wizards and their speeds
(in corridors per minute) predict which of them will reach the exit first. Assume that the magical wands used in the play
are capable of guiding the wizards to the exit along the shortest possible path.
given the labyrinth map, initial positions of the three competing wizards and their speeds
(in corridors per minute) predict which of them will reach the exit first. Assume that the magical wands used in the play
are capable of guiding the wizards to the exit along the shortest possible path.