Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment

Table 1

Algorithm implementation process.

Order					Optimal path
1	{2,3,4,5}	{1}	3	2
2	{2,4,5}	{1,3}	2	5
3	{4,5}	{1,2,3}	4	8
4	{5}	{1,2,3,4}	5	15

(1) Set : store the optimal path node not found; set : store the shortest path node found; represents the node in the set which is the shortest distance from the set ; represents the distance of the shortest path. (2) Store point 1 in set ; store the points 2, 3, 4, and 5 in set . (3) Find the nearest point in set , that is, point 3; move point 3 from to , and get . (4) Iterate to guide all points to set . At this point, the shortest distance between point 1 and other points can be obtained.