This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.

提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。

youdao

Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;

提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。

youdao

Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;

提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。

youdao