So the longest subway ride in NYC is 24km (15 miles) and 1h long? We have multiple underground lines farther than this in Berlin with the longest being 32km (20 miles). But don't get fooled, the issues are the same.
It's a game. You're supposed to click on the different route options that are presented to you on the bottom of the screen. That's why it goes slower the more options there are.
But I also just followed it for the first time from beginning to end, not doing anything. Because I assumed someone had already done the math.
Delays, vandalized carts, people jumping on tracks, intoxicated people on the train, buskers, no AC in the summer / heating in the winter, people talking on speakerphone / not wearing headphones, ...
The longest route on the NYC subway is precisely when you have an appointment and the train decides to stop because there's electrical issues, someone jumped on the track, "there's a train stopped ahead of us", the express decides to go local instead, someone is holding the door, your route involves the F/G or any line that serves less affluent neighborhoods...
Are you saying F/G AND any line serving less affluent areas? Because if not, the G (save for maybe 2-3 stops in Bed-Stuy) is all affluent neighborhoods.
So the longest subway ride in NYC is 24km (15 miles) and 1h long? We have multiple underground lines farther than this in Berlin with the longest being 32km (20 miles). But don't get fooled, the issues are the same.
It's a game. You're supposed to click on the different route options that are presented to you on the bottom of the screen. That's why it goes slower the more options there are.
But I also just followed it for the first time from beginning to end, not doing anything. Because I assumed someone had already done the math.
I did the same on the first ride. It is a game, you have to go jumping on different lines to get your longest.
Can you please elaborate more on these issues?
Delays, vandalized carts, people jumping on tracks, intoxicated people on the train, buskers, no AC in the summer / heating in the winter, people talking on speakerphone / not wearing headphones, ...
Is this like the travelling salesman problem, but looking for the longest, not shortest journey?
Finding the longest path in a graph is itself a pretty well-described NP-complete problem: https://en.wikipedia.org/wiki/Longest_path_problem
Alternately, you can listen to a Billy Joel parody that describes the problem in decidedly less academic terms: https://www.youtube.com/watch?v=a3ww0gwEszo
The longest route on the NYC subway is precisely when you have an appointment and the train decides to stop because there's electrical issues, someone jumped on the track, "there's a train stopped ahead of us", the express decides to go local instead, someone is holding the door, your route involves the F/G or any line that serves less affluent neighborhoods...
Are you saying F/G AND any line serving less affluent areas? Because if not, the G (save for maybe 2-3 stops in Bed-Stuy) is all affluent neighborhoods.