When we calculate the shortest route of the network by classical Dijkstra arithmetic,we need to calculate the route-lengths between nodal points which are unrelated to the shortest routes.
英
美
- 结合激光切割最短路径的计算问题,将模糊聚类分析与遗传算法相结合,提出了一种分级搜索最短路径的方法,该方法对于同类问题的解决具有借鉴作用。
- 今日热词
-
- 深远海浮式风电平台 - deep-sea floating wind power platform
-
- 京雄高速公路 - Beijing-Xiongan expressway
-
- 农业及相关产业增加值 - the added value of agriculture and related industries