您要查找的是不是：
- This paper adopts simultaneous iterative reconstruction technique (SIRT) to perform the crosswell tomography based on shortest path tree (SPT) curved ray tracing. 利用基于最短路径树弯曲射线追踪的联合迭代重建层析成像(SIRT)技术进行井间地震层析成像。
- Redundant links that are not part of the shortest path tree are blocked. 不是最短路径的备援连结将被阻隔。
- A computation based on Dijkstra's algorithm is used to calculate the shortest path tree inside each area. 著名的迪杰斯特算法被用来计算最短路径树。它使用“成本”作为路由度量。
- A Fast Low-Cost Shortest Path Tree Algorithm 低代价最短路径树的快速算法
- Single-source shortest path tree 单源最短路径树
- Shortest Path Tree (SPT) 最短路径树
- Shortest Path Tree(SPT) 最短路径树
- Not like other protocols, it can automatically reconstruct SPT when the shortest path changes and a member leaves, and no data packet is discarded or repeared in the transition. 在新路由协议方案的基础上，本文进一步提出了一种可靠组播方案。
- Shortest Path Transit Network Settings. 最短路径公交网络对话框。
- dual shortest path tree 对偶最短路径树
- shortest path tree 最短路径树
- Use a short path name if you can. 如果可以,请使用短路径名称。
- However,shortcut is the shortest path but not will be the fastest. 然而，快捷方式虽然是最短的路，却未必是最快的。
- The next page will discuss the shortest path algorithm. 下一页将讨论最短路径演算法。
- Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network. 图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。
- Make sure that the path name is in a short path (DOS 8.3) format. 确保路径名称为短路径(DOS 8.;3)格式。
- This name may not initially appear to be a short path name. 此名称初看起来不像是短路径名称。
- A path tree spanning algorithm (PTSA) is designed to compute page accessibility. 为计算网页可达性,设计了计算到达网页路径的路径树生成算法(PTSA)。
- The tools can be stochastic choose through shortest path from bidirectional. 双向随机最短路径选刀。
- And alters their values to find a curve that flows along the shortest path. 并对其值进行调整以找到路径最短的曲线。
