首页> 外文期刊>Information and Knowledge Management >Transportation Routes with Fastest Determination Algorithm Prim in Department of Transportation
【24h】

Transportation Routes with Fastest Determination Algorithm Prim in Department of Transportation

机译:交通运输部采用最快确定算法的运输路线

获取原文
           

摘要

Prim's algorithm is an algorithm in graph theory minimu spaning looking for a tree to resolve the problems TSP example is the replacement of the telephone network system or service transport lines making ari mail post box, and so on. In DISHUB (Department of Transportation), especially in Asahan. Which are currently experiencing density of transport, even experienced problems in determining the appropriate transport connections needed in Asahan. So on the basis that the author describes a case study with the determination of the transport path in Asahan District Department of Transportation
机译:Prim的算法是图论中最小限度的算法,它寻找树来解决问题TSP的例子是更换电话网络系统或制作ari邮箱的服务传输线,等等。在DISHUB(交通运输部)中,尤其是在Asahan中。目前正在经历运输密度的问题,甚至在确定Asahan所需的适当运输连接时也遇到了问题。因此,在作者描述一个案例研究的基础上,确定了朝日区交通局的运输路径

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号