The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network
Algorithm 3
Node queue operation (Module 3).
(1)
DeQueue()
% Select each arc (i, l) that satisfies the condition and is not on the breadth-first search tree, insert it into the breadth-first search tree, and insert such arcs (i, l) into the stack in turn (the arc is marked as R)
(2)
for do % take a node from the queue
(3)
ifthen
(4)
;
% Determine whether node is isolated, if it is, delete node from the queue .
(5)
else
(6)
for each;
% Perform the following operations for each predecessor node i of the node .
(7)
if do
(8)
EnQueue;
(9)
; % insert node i into the queue
(10)
;
% insert (i, ) into the set and mark it as a black arc.
(11)
(12)
(13)
% Calculate the optimal path from all arc segments (i, ) with as the end node to the destination.
