num of vertices |v| = 5 {A, B, C, D, E}

num of iterations |v| - 1 = 5 - 1 = 4

relaxation:
if d[v] + c[u, v] < d[v]
d[v] = d[u] + c[u, v]
edgelist: {A,B}, {A,C}, {A,D}, {B,C}, {B,E}, {C,E}, {D,C}, {D,E}

1st iteration
edgelist a b c d e
0 ∞ ∞ ∞ ∞
{A,B} 0 4 0+4=4
{A,C} 3 0+3=3
{A,D} 5 0+5=5
{B,C} 2(3) 4-2=2<3 change
{B,E} 6 4+2=6
{C,E} 2(6) 3-1=2<6 change
{D,C} 6(2) 5+1=6<2 retain
{D,E} 3(2) 5-2=3<2 retain
0 4 2 5 2

2nd iteration
edgelist a b c d e
0 4 2 5 2
{A,B} 0 4 0+4=4<4 retain
{A,C} 2 0+3=3<2 retain
{A,D} 5 0+5=5<5 retain
{B,C} 2 4-2=2<2 retain
{B,E} 6(2) 4+2=6<2 retain
{C,E} 1(2) 2-1=1<2 change
{D,C} 6(2) 5+1=6<2 retain
{D,E} 3(1) 5-2=3<1 retain
0 4 2 5 1

3rd iteration
edgelist a b c d e
0 4 2 5 1
{A,B} 0 4 0+4=4<4 retain
{A,C} 2 0+3=3<2 retain
{A,D} 5 0+5=5<5 retain
{B,C} 2 4-2=2<2 retain
{B,E} 6(1) 4+2=6<1 retain
{C,E} 1 2-1=1<1 retain
{D,C} 6(2) 5+1=6<2 retain
{D,E} 3(1) 5-2=3<1 retain
 0 4 2 5 1

ans:
a=0
b=4
c=2
d=5
e=1
2=2<3 change

1 = 2 < 6 change
1 = 6 < 2 retain
2 = 3 < 2 retain

4=4<4 retain
3=3<2 retain
5=5<5 retain
2=2<2 retain
2=6<2 retain
1=1<2 change
1=6<2 retain
2=3<1 retain

4=4<4 retain
3=3<2 retain
5=5<5 retain
2=2<2 retain
2=6<1 retain
1=1<1 retain
1=6<2 retain
2=3<1 retain