Application of Java — Based optimization Dijkstra algorithm in parking lot berth guidance

Dijkstra algorithm is a single-source shortest path algorithm, and the result is the shortest distance from the source node to the destination node. In the parking guidance process, the shortest parking route is actually not the best parking guide route, need to consider the element of the safety of people and vehicles, shorten the time to find berths. In this paper, we use the Java programming language to implement Dijkstra algorithm with constraints, the optimum parking guidance route is obtained by comparing the berth to the sum of the exit and entrance distances. This approach allows users to more quickly and safely complete the task of parking, car park operation and management more efficient.