We consider a market where the consumers are distributed in the vertexes of a transportation graph. The edges of the graph are the transportation links. The vertexes are the hubs. The consumers are the passengers who use this kind of transportation. The demand is determined by the flow of passengers. There are n companies (players) who make a service in this market. First, players form their transportation networks, and then they announce the prices for the service. The objective of a player is to maximize the payoff. We derive the equilibrium in this non-cooperative game. The results of numerical simulations are provided.