[HN Gopher] What commercial flight route needs the most (min pos...
       ___________________________________________________________________
        
       What commercial flight route needs the most (min poss.) stops from
       A to B?
        
       Author : beatthatflight
       Score  : 32 points
       Date   : 2024-09-22 22:40 UTC (1 days ago)
        
 (HTM) web link (travel.stackexchange.com)
 (TXT) w3m dump (travel.stackexchange.com)
        
       | RIMR wrote:
       | Slightly unrelated, but you can book flights between Seattle
       | (SEA) and Everett (PAE), and there's a PAE-LAS-SFO-SEA route that
       | takes 20 hours.
       | 
       | These two Airports are only 37 miles away from each other.
       | There's a shuttle between them that takes 75 minutes.
        
         | madcaptenor wrote:
         | It looks like Alaska will sell you tickets for PAE to SEA via
         | any one of SFO, LAS, LAX, PHX...
        
       | dmbaggett wrote:
       | It depends on when you do the query. Years ago (mid 2000s) at
       | ITA, Carl wrote code to find the longest possible shortest route
       | between any two airports with scheduled flights. At the time the
       | winner was Wasu, New Guinea to Peawanuck, Ontario, which took a
       | minimum of 90 hours and many flights. There are airports you can
       | only get to at the end of a long line of stops; this drives the
       | number of stops way up.
        
       | nemetroid wrote:
       | ICAO four-letter airport codes are hierarchical. The first one or
       | two letters indicate the country, e.g.:
       | 
       | EDDF - Frankfurt (E: Northern Europe, D: Germany)
       | 
       | EKCH - Copenhagen (E: Northern Europe, K: Denmark)
       | 
       | VTBS - Bangkok (V: South/Southeast Asia, T: Thailand)
       | 
       | KJFK - New York JFK (K: USA)
       | 
       | Using ICAO codes, you can make sense of a written out route at a
       | glance. Taking one of the examples from the link:
       | 
       | AUY TAH VLI BNE BKK CPH SFJ JAV JUV NAQ
       | 
       | becomes
       | 
       | NVVA NVVW NVVV YBBN VTBS EKCH BGSF BGJN BGUK BGQQ
       | 
       | I.e.: Vanuatu (a few jumps) -> Australia -> Thailand -> Denmark
       | -> Greenland (a few jumps).
        
       | meow_catrix wrote:
       | Make a connectedness matrix of airports x airports with 1 marking
       | a connection and 0 marking no connection. You can now iterate
       | over legs by multiplying the matrix with itself. Do this until
       | all values in the matrix are zero. The previous iteration shows a
       | 1 where the longest routes are.
        
       | t0mas88 wrote:
       | Back when airline status was based on number of segments this
       | would have been a useful tool if you could find the lowest cost
       | route on a single airline group. For example "find the most
       | number of segments at the lowest cost per segment using only One
       | World flights"
        
       ___________________________________________________________________
       (page generated 2024-09-23 23:01 UTC)