Public transport is preferred by most of the people since it provides various advantages. As a result, many route-planning applications are developed for users of public transport. The general aim of these applications is proposing the ideal route for a given destination; however, there are various route-planning criteria for public transport. According to our research, “the number of transfers” is seen as the primary criterion for the route planning by most users. In this study, an approach for public transport is proposed in order to recommend the route that is comprised of minimum number of transfers. In this approach, Space P and a pareto optimal solution are used for modelling network, then Breadth First Search is modified to plan the ideal route on the modelled network. Furthermore, the proposed approach is experimented on the public transport network of Izmir. It is proved that from any source to any target, our route recommender returns the path with the minimum number of transfers optimally within milliseconds.