摘要
基于Dijkstra、Floyd等相关经典最短路径算法,结合行驶中的电动汽车查找充电桩的实际需要,提出一种随机生成联通网的方法和一种改进的Floyd算法,将二者结合采用高级语言实现并进行测试.结果表明,随机生成联通网的方法提高了对图和网络中最短路径等相关算法研究的效率,改进的Floyd算法在解决电动汽车充电申请问题上具有一定的实用价值.
A method of randomly generating the interconnection network and an improved Floyd algorithm were proposed on the basis of the study of Dijkstra,Floyd and other related classical shortest path algorithms coupled with the actual needs of the driving electric vehicle to find the charging pile.Their combination was implemented in high-level language and tested.The result shows that the method of randomly generating the network increases the efficiency of the research on the shortest path algorithm in the network and graph;the improved Floyd algorithm has a certain practical value in solving the problem of electric vehicle charging application.
作者
王飞
袁涛
王蒙
WANGg Fei;YUAN Tao;WANG Meng(Anhui Technical College of Mechanical and Electrical Engineering,Anhui Wuhu,241002)
出处
《玉溪师范学院学报》
2020年第3期78-85,共8页
Journal of Yuxi Normal University
基金
2016年高校优秀青年人才支持计划重点项目(编号:gxyqZD2016476)
2018年安徽省高等学校省级质量工程项目-物联网应用技术专业教学团队(编号:2018jxtd077)
2018年安徽省高校自然科学项目(编号:kj2018A0863)
关键词
联通网
随机生成
改进Floyd算法
Unicom network
random generation
improved Floyd algorithm