论文中提出了一种基于常规最短路径方法的分词算法：层进式最短路径分词方法。
This article introduce a way called layer shortest path way based on conventional shortest path way.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
实现此目标的最佳方法是，找到给定站点与稳定的可理解的站点之间的最短路径。
The best way to do that is to find the shortest path between the site you are given and one that is stable and understandable.
应用推荐