Description: The shortest path method segmentation program source code. Chinese sentence After atomic segmentation, to generate a directed acyclic graph, and then use Dijkstra algorithm to calculate the shortest path from start to finish in order to achieve the Chinese word.
To Search:
File list (Check if you may need any files):
sMySSeggh\MySeg\coreDict.dct
.........\.....\Dictionary.cpp
.........\.....\Dictionary.h
.........\.....\Graph.cpp
.........\.....\Graph.h
.........\.....\MySeg.cpp
.........\.....\MySeg.h
.........\.....\MySeg.ncb
.........\.....\MySeg.rc
.........\.....\MySeg.sln
.........\.....\MySeg.suo
.........\.....\MySeg.vcproj
.........\.....\MySegDlg.cpp
.........\.....\MySegDlg.h
.........\.....\ReadMe.txt
.........\.....\resource.h
.........\.....\Segment.cpp
.........\.....\Segment.h
.........\.....\stdafx.cpp
.........\.....\stdafx.h
.........\MySeg
sMySSeggh
Download