Abstract: 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 p_{ij ,}q_{ij ,}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.

Key words: traffic control, restricted routes, optimal path, Floyd algorithm

摘要： 研究含有禁止转向限制的网络中，任意节点间最优路径问题。在Floyd算法基础上，通过引入正向和反向两种路径标记 p_ij、q_ij，建立了一种禁行路径的判断规则，给出了一种适用的路径寻优迭代算法。在不改变网络的拓扑结构的情况下，该算法可同时获得所有任意两点间的最优路径。

关键词: 交通管制, 禁行路线, 最优路径, Floyd算法