Issn 2072-0297 Молодой учёный Международный научный журнал Выходит еженедельно №3 (137) / 2017 р е д а к ц и о н н а я к о л л е г и я : Главный редактор
жүктеу/скачать 9,13 Mb. Pdf көрінісі
|
moluch 137 ch1
| .
№ 3 (137) . Январь 2017 г. 4 Математика Application of searching algorithm for fi nding shortest paths in a weighted graph for economy on long-distance train journey Иринина Юлия Сергеевна, магистрант Самарский национальный исследовательский университет имени академика С. П. Королёва The article describes the practical application of the graph theory, shows the application of the shortest-path fi nding algorithm, uses program realization to fi nd a solution, fi nds the most economical way to get from one point to another. Key words: analysis, graph theory, Bellman-Ford algorithm, shortest-path fi nding algorithm, program realization N owadays society is at the stage when a trip to another country or to another city is not diffi cult. The turnover is made within not one particular city, but the country or even around the hole world. Freight transport is a part of everyday life not only for professional companies, but also for ordinary citizens: they send parcels to other regions, buy goods from other cities and from abroad. People also often travel from one city to another. Also diff erent companies have to spend a lot of money to pay for travel of their employees to other cities. In this paper, we consider such an urgent problem at the moment, as the savings in civilian intercity trips, particularly on trains. As a continuation and improvement of practical application of this work in the future, we plan to take into consideration not only civil trip, but also freight transport. To study is taken the route from Samara to Moscow. All possible routes of trains are represented as a graph, where the vertices — stations, fi ns — path be- tween stations, rib weight — ticket price from one station to another. One can get from Samara to Moscow by selecting one of the three trains: № 55, № 121E and № 131U. [1] Contemplated in the paper stations are shown in the Table 1: Table 1. жүктеу/скачать 9,13 Mb. Достарыңызбен бөлісу:
|