The growing population of drivers and vehicles on the road has also grown. Proportional interests in the routing devices also come to the fore. Nowadays there are a lot of devices and studies with reference to the problem of point-to-point fastest past planning. Today we have got a clear picture concerning the computing needs and the response time of each routing algorithm. Nevertheless, most of these devices have a simplified supposition that the travelling time is constant on the edges of the model. However, on the edges of real spatial networks, the travelling time can be influenced by many other factors. In my dissertation I looked for and examined such factors as well as how the travelling time is influenced by them. With full knowledge of these facts I planned a model that produces a graph for car routing algorithms by considering the factors. Finally, I carried out the interface between the designed model and the routing applications.