Multi-stage diagram of dynamic programming

Conversion equation:
Cost [i, j] = min (Cost [i + 1, l] + c [j, l])

      for(i=0;i<n;i++) v[i]=0;
      for(i=n-2;i>=0;i--)
     { 
     for(length=100,j=i+1;j<=n-1;j++)
                if(cost[i][j] > 0 && (cost[i][j])+v[j]<length)
                  {length=cost[i][j]+v[j]; temp=j;}
              v[i]=length;
              d[i]=temp;
        }
      path[0]=0;
      path[k-1]=n-1;
      for(i=1;i<=k-2;i++) (path[i])=d[path[i-1]];