Erich Prisner

UMUC SG

Spring 2002

##
Floyd's Algorithm

See the adjacency matrix of one of the graphs shown by clicking on the corresponding graph button.
Click 11 times on the "increase m" button to see the distance matrix --- "-" denotes infinity.
Again A_{m} denotes the distance matrix with only paths with intermediate
vertices in 1,2,...m allowed.
We use the formula
a_{m}(i,j) = min{a_{m-1}(i,j),a_{m-1}(i,m)+a_{m-1}(m,j)}