It's a python code. Please do not copy. Do it uniquely I will surely upvote. PLease follow the question properly. You h

[answerhappygod]

It's a python code.Please do not copy. Do it uniquely I will surely upvote. PLease follow the question properly. You have to take inputs from a.txt file. You are allowed to use a built-in list, dictionary,arraylist and queue.

It S A Python Code Please Do Not Copy Do It Uniquely I Will Surely Upvote Please Follow The Question Properly You H 1 (348 KiB) Viewed 47 times

You Pallet Town Lavender Town Victory Road Indigo Plateau Pewter City Cerulian City Celadon City Fushcsia City Safari Zone Viridian City Cinnabar Island Team Rocket's Lair Suppose one fine morning, you woke up in the world of Pokémon. Now you decided to become a Pokémon master just like your childhood idol Ash Ketchum. In order to do so, you have to defeat the gyms/bad guys in the places you walk into in a limited amount of time. Your goal is to get to the Victory Road as quickly as possible.
You were given a map of the region. Create a Graph (preferably with adjacent lists) that represents all the places of the region. To help us calculate, we shall assign a number to each of the places on the map: 12 17 Sample Inputs: 1 3 2FFNNNM M M 5566700000 = NASAFONTO FOURIE 3 8 8 9 Places Pallet Town (Starting Point) 10 Cerulean City Celadon City Lavender Town 11 Viridian City Cinnabar Island Fuchsia City Safari Zone Team Rocket's Lair Indigo Plateau Pewter City Victory Road (Destination) 2 3 4 5 4 7 11 6 7 7 8 11 9 10 10 11 12 Designated Number 1 2 3 4 5 6 7 8 9 10 11 12 [Here in the first row, 12 means the number of places. In the second row, 17 means the total number of connections. The third row indicates that 1 and 2 are connected. The same rule applies for the rest of the rows. Assume that the first place is the Starting point and the last place is the destination] Create a graph using the above values! 12 HAUSBLOGAWN 3 5 6 7 8 9 10 11 12 234 671910 112 4 7 7 8 10 Connected Places 2 3, 4, 5 4,7,11 6, 7 7,8 11 9, 10 10 11 12 5 11 [Here in the first row, 12 means the number of places. In the second row, 1 is connected to 2. In the third row, 2 is connected to 3, 4, and 5. The same rule applies for the rest of the rows. Assume that the first place is the Starting point and the last place is the destination]