Optimal path algorithm for network with direction-prohibited routes among some nodes
Yue Ai-feng · Computer Engineering and Applications Journal · 2009
This paper resolves the optimal routing problem between two arbitrary nodes in general network,of which contains some direction-prohibited routes.On the basis of the Floyd algorithm and with the establishment of the restricted path judging rules,this paper introduces the path labeling pij ,qij ,which respectively label positive and reverse direction.No need to change the network topology circumstances,the path optimization between two arbitrary nodes is obtained by the iterative algorithm.