“…Algorithm 3 Expand_nodes (gðV; E; WÞ, completed, MinF, MinB, Llabels, Rlabels, M, CurrCost, iter) Along the way, each thread updates MinF (the minimum shortest path cost updated among threads from the source side in that iteration, lines [6][7][8]. MinF is used in the check for the early termination condition as shown in lines 7-10 in Algorithm 1.…”