The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network
Algorithm 2
Arc stack operation (Module 2).
(1)
Push (stack);
% 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)
do
(3)
;
(4)
;
% Remove node l from the set of successor nodes of node i
(5)
Until;
% Breadth-first search tree construction completed
(6)
Pop(stack, );
(7)
While
% when the optimal path from all arcs on the tree to the destination has not been obtained, proceed as follows
(8)
do
(9)
Color ← ;
(10)
;
(11)
(12)
(13)
% Calculate the minimum time from each arc segment on the breadth-first search tree to the destination in the stacking order and record the path.
(14)
then
(15)
% Delete node i from the predecessor node of node l
