The shortest path problem can be described on the transport network: 1.) transport network has n hubs, where 1is starting point and hub n is destination point. 2.) near by hubs are connected with the links