最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图，然后使用Dijkstra算法求出由起点到终点的最短路径以实现中文分词。-shortest path method participle procedures. Chinese Sentence will be read after splitting atoms generated a directed acyclic graph. then use the Dijkstra algorithm derived from the s

Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph