The aim of this study is to define a label setting algorithm for air transport that allows to the find shortest routes between any two airports. In this case, the shortest routes will be defined as all routes within a range of time near the shortest time. The label setting algorithm will be written in C++ (and a bridge with R). Codes will be based on R and C++ package 'igraph'. Furthermore, air transport networks will be analyzed.
