Skip to main content

Table 1 The shortest distance calculation process between node a to node e

From: Research on the construction and simulation of PO-Dijkstra algorithm model in parallel network of multicore platform

StepsPathD(b)D(c)D(d)D(e)
Initialization{a}24.0034.0015.00
The first calculation{a, d}24.0033.0015.0073.00
The second calculation{a, d, b}24.0033.0015.0073.00
The third calculation{a, d, b, c}24.0033.0015.0060.00
The fourth calculation{a, d, b, c, e}Push back the path: e, c, d, a