grafo Bellman

k[]=lamda(i)-> corresponde a las aristas que llegan al nodo

T mensaje en las aristas
para(i=0, hasta total_nodos-1)
{
K[0]=0;
K[1]=0:
para(j=1 hasta n)
{
k[j]=min(k[i]+T(i,j))
}
}
{
.........................................
k[0]=0
.........................................
k[1]=0
.........................................
k[2]=min(k[1]+T(1,2))
k[2]=min(0+4)
k[2]=4
.........................................
k[3]=min([k[1]+T(1,3)],[k[2]+T(2,3)])
k[3]=min([0+5],[4+6])
k[3]=min(5,10)
k[3]=5
.........................................
k[4]=min([k[2]+T(2,4)])
k[4]=min(4+6)
k[4]=min(10)
k[4]=10
.........................................
k[5]=min([k[2]+T(2,5)],[k[3]+T(3,5)],[k[4]+T(4,5)])
k[5]=min([4+8],[5+7],[10+3])
k[5]=min(12,12,13)
k[5]=12
.........................................
k[6]=min([k[2]+T(2,6)],[k[3]+T(3,6)],[k[4]+T(4,6)],[k[5]+T(5,6)])
k[6]=min([4+17],[5+10],[10+4],[12+2])
k[6]=min(29+15+14+14)
k[6]=14
}