Specific functions include a 2-point shortest path between the dynamic display, the segment length annotation.

FIGURE 5. Determining the shortest path from the origin to the destination.

图5. 决定从出发点到目标点的最短的路径.

This paper is to study the shortest path problem with fuzzy parameter.

本文研究具有模糊参数的最短路径问题.

Low-cost shortest path tree is a commonly-used multicast tree type.

低代价最短路径树是一种广泛使用的多播树.

Node path length can be calculated in accordance with the shortest path!

可以根据节点路径长度计算最短路径! -Vc6.

The so-called topological sorting refers to the vertex order in accordance with the topology.

所谓拓扑排序是指将顶点按照拓扑次序排列.

At last, extract the characters with the method of analyzing the structure of connected components.

最后, 用连通成分结构分析的方法来提取汉字.

Two heuristic strategies for solving satisfiability ( SAT ) problem were presented.

提出了两个用于求解可满足性 ( SAT ) 问题的启发式策略.

Fourier inverse transform IFFT, to restore the signal from the frequency domain.

用傅里叶反变换IFFT, 从频域恢复信号.

Graphic Presentation of Application Related Concepts in Fourier Analysis.

图示富氏分析之应用相关概念.

Further analysis shows that the quadrature filtering algorithm is a simplified algorithm of Discrete Fourier Transform ( DFT ) .

进一步分析表明,正交滤波算法是 离散傅立叶 变换的一种简化算法.

The influences of the CCD resolution and the discrete Fourier transform on correlation results are discussed.

讨论了CCD分辨率 和离散傅里叶变换等因素对光电混合检测效果的影响.

Results of the numerical experiment show it is effective and useful in solving 0-1 knapsack problem.

仿真实验结果表明了该算法求解0-1背包问题的有效性与适用性.

According to thethe existed algorithms of 0-1 knapsack problem, a new non-recursive algorithm the paper.

针对目前求解0-1背包问题算法的优缺点, 开发了一种新的 非 递归算法.

These are universal data structures.

这些都是常见的数据结构.

Practice information hiding: Separate the application of data structures from their implementation.

使用信息隐藏: 将数据结构的应用与它的执行分开考虑.

His doctoral thesis was on Algorithms and Data Structures for Dynamic Graphs.

他的博士论文是动态图表的算法和数据结构.

Variables are used to store values of data structures.

变量是用来存储数据结构内容的.

Relative kernel service routines and basic data structures are carefully designed.

给出了相关内核服务例程和基本的数据结构的设计.

As in," We know exercise is good, but why?"

例如，“我们知道运动有益，但是为什么？”

Repeat these five steps, as in the last exercise.

照前面的练习一样，重复这五个步骤。