One Improvement to Find the Nearest Route by Matrix Iteration Method in Traffic Flow Distribution

The method of all-or-nothing nearest route is one way to distribute traffic flow.The matrix iteration method can be used to find the nearest route in a figure with directions and weights.The largest number of iteration may be n-1 by traditional method to the figure with n points.However,the largest number of iteration is └logn-12 ┘ or └logn-12┘+1 by calculating D2r′+1 from D2r′.The improvement is especially evident to this kind of figure with a large number of points.