期刊文献+

改进BFS算法在打包机电缆路径计算中的设计与实现

Design and implementation of BFS algorithm in calculation of cable path of packer
下载PDF
导出
摘要 随着计算机科学的迅猛发展,图论的最短路径算法广泛应用于工业生产、通信、自动化控制等诸多学科领域。传统打包机生产设计中的电缆最短路径设计多采用人力依次拾取电子样中预先设置好的电缆节点,费时费力容易出错。文章采用改进的BFS最短路径算法,利用Python编程,设计了一款可添加必过节点和避开节点的电缆最短路径寻径程序,旨在帮助设计人员进行电缆路径设计。 With the rapid development of computer science.the shortest path algorithm of graph theory is widely used in industrial production,com munication,automatic control and many other disciplines.The design of the shortest path of cable in the production design of traditional baling machine mostly uses manpower to pick up the pre-set cable nodes in the electronic sample in turn,which is time-consuming.laborious and easy to make mistakes.Using the improved BFS shortest path algorithm and python programming,this paper designs a cable shortest path routing program.that can add necessary nodes and avoid nodes to help designers design cable paths.
作者 董福鑫 DONG Fuxin(Hgang Huitang Xinye Metal Packaging Workshop,Tangshan,Hcbci 063000,China)
出处 《计算机应用文摘》 2022年第18期51-53,共3页 Chinese Journal of Computer Application
关键词 电缆最短路径 改进BFS算法 PYTHON cable shortest path improved BFS algorithm Python
  • 相关文献

二级参考文献27

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部