Graph Traversal
Budget: $30 – $250 USD
It requires you to model the problem below as a graph and then use a known graph
algorithm to solve the problem.ou must traverse a field of arrows (red or blue). You must find a route from the arrow in the
top left corner to the bullseye in the bottom right corner. You must follow the direction that the
arrows point, and you can only stop on the other colored arrow or the bullseye. For example, start
on red, then chose a blue arrow (in the direction that the red arrow is pointing), then from the blue
arrow chose a red arrow in the direction the blue arrow is pointing. Continue in this fashion until
you find the bullseye in the bottom right corner. It does not have to be the first opposite color that
you find. You may find your-self in a loop and continuously visiting the same arrows; you need
to account for this. You must find the correct path. You also need to handle what happens if you
get to a node that you already visited within a path and you need to continue in that direction.
You have to do the code in python
algorithm to solve the problem.ou must traverse a field of arrows (red or blue). You must find a route from the arrow in the
top left corner to the bullseye in the bottom right corner. You must follow the direction that the
arrows point, and you can only stop on the other colored arrow or the bullseye. For example, start
on red, then chose a blue arrow (in the direction that the red arrow is pointing), then from the blue
arrow chose a red arrow in the direction the blue arrow is pointing. Continue in this fashion until
you find the bullseye in the bottom right corner. It does not have to be the first opposite color that
you find. You may find your-self in a loop and continuously visiting the same arrows; you need
to account for this. You must find the correct path. You also need to handle what happens if you
get to a node that you already visited within a path and you need to continue in that direction.
You have to do the code in python