Guys, I have a problem and needs to determine an algorithm using
java. The problem is this image:
Santa Claus needs to go to all of the places marked in red. He starts in the topmost level (Santa Claus Village)
And he needs to go to places marked in circles chronologically (or not chronologically) from left to right.
For example, to go to California, he must go to North America then to Us then to California.
After going to california, he must go to LA by going back to US then travel to Texas then LA.
He must go to Virginia by going back to Texas to US then Virginia
Then he must go to Hidalgo by going back to US then North America >Mexico>Hidalgo
Then go to Germany by back to Mexico> North America > Santa Claus Village > Europe > Germany and so on...
The hardest part is that there is no finite number of loop inside NA, Europe and Asia
Please advice me people. I'm having hard time solving this problem. Please please please