“…And the path set between node 1 and node 6 is empty (2) we compute the path which weight is smallest:{1,2,4,6},{1,2,5,6} and {1,3,5,6}(the smallest weight is 3:{1,2,4,6}), (3) judge the path {1,2,4,6} is not in the path set. (4) add a Δw=1 to the weight of the link (1,2), (2,4) and (4,6), update the weight w(1,2)=w (2,4)=w (4,6)=2. (5) calculate the second path w{1,2,5,6}=2+2+2=6, w{1,3,5,6}=2+3+2=7, the w{1,2,5,6} is smaller and joins in a path set, then update the weight.…”