专业释义
-
最短路径 - 引用次数：15
In short path calculating,the classical Dijkstra algorithm is often used,but it requires the comparison among large amounts of data. Moreover,those data comparison is not necessarily made when the distance between the two nodes in a graph equals infiniteness.
在求解最短路径时经常使用经典的Dijkstra算法,但在实际应用中在计算最短路径长度时需要进行大量的数据比较,而当图中两顶点之间的距离是∞时,是没有必要进行比较的。
参考来源 - 基于存储结构的Dijkstra算法优化短路径
·2,447,543篇论文数据，部分数据来源于NoteExpress
双语例句原声例句权威例句
-
It's a short path to drawing hands of a set number of cards or building a multideck shoe.
这是绘制一定数量的牌手或建造多层甲板鞋的捷径。
-
At the top, you follow a short path to a stone-and-steel observation tower.
在山顶，你可以从一条小径到达建在石头上的铁观察塔。
-
This may not be a very short path, but at least you will not repeat the same corridors.
这条路也许并不很短，但是至少您不会反复走相同的过道。
应用推荐