What will I learn?
With this programming puzzle, you implement a pathfinding algorithm like A star, store and process the map of a city in the form of a graph.
Given a list of train stations, their locations and connections, a starting point, and a final point, determine the names of the stations from the start to the end, based on the shortest path.
A higher resolution is required to access the IDE
"Yeah, sure. Wait... Gonna have to call you back, I'm entering the subway.... No, not the sandwich thing, the... Oh come on.... Yeah, I'll meet you at the museum. No, the one next to the plaza where we had a coffee last week. Take the tramway line 6. Yeah. Right. Bye."