李玉兰, 李耀堂. 城市道路网容量的对偶图算法[J]. 云南大学学报(自然科学版), 2006, 28(4): 293-297.
引用本文: 李玉兰, 李耀堂. 城市道路网容量的对偶图算法[J]. 云南大学学报(自然科学版), 2006, 28(4): 293-297.
shu
LI Yu-lan, LI Yao-tang. Dual graph algorithm for the volume of the city road network[J]. Journal of Yunnan University: Natural Sciences Edition, 2006, 28(4): 293-297.
Citation: LI Yu-lan, LI Yao-tang. Dual graph algorithm for the volume of the city road network[J]. Journal of Yunnan University: Natural Sciences Edition, 2006, 28(4): 293-297.
shu

城市道路网容量的对偶图算法

Dual graph algorithm for the volume of the city road network

    摘要
  • 摘要: 在给定路网结构和路段通行能力的基础上,借助图论中最大流最小割定理,给出1种求路网容量的方法———对偶图算法,为路段通行能力约束下路网容量的确定提供了1种新途径.

     

    Abstract: Based on the road network construction and the traffic capacity of the links,a computational method of the road network volume was given.From this a new way was got to obtain the road network maximal traffic volume in restrict of the traffic capacity of the links.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回