• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ICCEE 2010;International conference on computer and electrical engineering >An Algorithm of P-D Studied on The Basis of The Algorithm of Prime And Dijkstra
【24h】

An Algorithm of P-D Studied on The Basis of The Algorithm of Prime And Dijkstra

机译：基于Prime和Dijkstra算法研究P-D算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

P-D algorithm uses the Prime Algorithm of Minimal Spanning Tree and Dijkstra algorithm of shortest path, and improved from them:judging by the point weight, devide these points into two groups, points of the first group are much larger than the second. The first group uses Prime algorithm, and the second group uses Dijkstra algorithm ,using the biggest point of the first group as the source point.lt applies to problems that part of points' weight are much larger than the rest of points' weight, sides' weights are close to the points' weight in the smaller group and greater point is adapted between two points and multiplied with the edge weight
机译：P-D算法使用最小生成树的Prime算法和最短路径的Dijkstra算法，并对其进行了改进：从点的权重来看，将这些点分为两组，第一组的点比第二组的点大得多。第一组使用素数算法，第二组使用Dijkstra算法，以第一组的最大点作为源点。适用于点的权重部分远大于其余点的权重，边长的问题。 '权重接近点'较小组中的权重，较大点在两点之间调整并乘以边缘权重

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号