Algorithm 360: shortest-path forest with topological ordering [H]
Robert B. Dial · Communications of the ACM · 1969
view.)Write the observations in the order specified above.Write row one of Mn down the right edge of a strip of paper using the same spacing as for the observations. Now place this movable strip alongside the observation vector so that the top element on the paper strip is opposite the top element of the observation vector.Multiply adjacent elements and write the sum of these products at the top of a new column.Now slide the paper strip down tn spaces.Form the indicated inner product as before and