Table 1 The shortest distance calculation process between node a to node e
Steps | Path | D(b) | D(c) | D(d) | D(e) |
|---|---|---|---|---|---|
Initialization | {a} | 24.00 | 34.00 | 15.00 | ∞ |
The first calculation | {a, d} | 24.00 | 33.00 | 15.00 | 73.00 |
The second calculation | {a, d, b} | 24.00 | 33.00 | 15.00 | 73.00 |
The third calculation | {a, d, b, c} | 24.00 | 33.00 | 15.00 | 60.00 |
The fourth calculation | {a, d, b, c, e} | Push back the path: e, c, d, a | |||