Your friends think that you are no brave enough to enter the Haunted House from the front door and exit the back door all alone. But you argue that you are not afraid of doing this! Now, they challenge you to do it! OK. You can do it J

Assume that you are given the plan of the haunted house. In the plan you can see which room has a door to which other rooms as below figure. Being a genius computer or software engineering student who has already taken the Algorithms Course J you can find a shortest path from the front door to the back door so that you will not stay at the haunted house longer ;)

OK. First question you have to solve is that how can you represent the rooms and doors in a data structure? Which data structure is more suitable? Why? What would be the space requirements?

After deciding the data structure, now you should fill this data structure according to the example house plan.

Alright almost finish. Now, you need an algorithm to compute the shortest path from the front door to the back door! Does it ring a bell? Which algorithm can you use?

Ok. I think that you find the base algorithm. Bravo!

But you have to modify it such that the algorithm should stop when it finds the back doorJ You dont actually want to find all the shortest paths to all the rooms, right?

As a last step, output the path from the front door to the back door.