算法与数据结构基本知识.pptVIP

  • 1
  • 0
  • 约2.83千字
  • 约 44页
  • 2019-07-16 发布于四川
  • 举报
最短路算法 Dijkstras algorithm Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 12 15 Visited 1 0 0 0 0 0 Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 8 10 Visited 1 0 0 1 0 0 Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 5 10 Visited 1 1 0 1 0 0 Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 5 8 Visited 1 1 1 1 0 0 Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 5 7 Visited 1 1 1 1 1 0 Dijkstra   City 1 City 2 City 3 City 4 City 5 City 6 Dist 0 2 3 1 5 7 Visited 1 1 1 1 1 1 图的遍历 遍历的意思就是按照一定的顺序,访问整个图的所有顶点

文档评论(0)

1亿VIP精品文档

相关文档