Application of Dijkstra algorithm in finding the shortest path

Abstract

As the development of Automotive, people are doing research on self-driving and innovation of public transportation. The coming of 5G will made these come true soon in the future. And this paper is about an algorithm useful on transportation. Using Dijkstra algorithm to match two people who have the similar source and destination, then find the shortest path for them. For each person, the source and destination are two regions but not two points. This paper includes some methods to implement Dijkstra algorithm in detail and two examples to display the results. The algorithm is written in C language.