【24h】

An optimal path algorithm of high security based on Dijkstra algorithm

机译:基于Dijkstra算法的高安全性最优路径算法

获取原文
获取原文并翻译 | 示例

摘要

Traditional Dijkstra algorithm wastes a lot of time and storage space in applications, this paper optimizes this algorithm with the combination of partition first searching strategy and adjacent table storage structure based on the study of traditional algorithms and proposes a method to obtain the optimal path with the improved algorithm in cyber-physical systems, in which real-time information is provided. This paper uses a secure transmission scheme to achieve a complete and security solution for path optimization, and proves the advantages of the optimal algorithm by simulation.
机译:传统的Dijkstra算法浪费了应用程序的时间和存储空间,本文在研究传统算法的基础上,结合分区优先搜索策略和相邻表的存储结构对该算法进行了优化,提出了一种利用该算法获得最优路径的方法。在网络物理系统中提供实时信息的改进算法。本文采用一种安全的传输方案来实现完整,安全的路径优化解决方案,并通过仿真证明了该算法的优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号