Introduction - If you have any usage issues, please Google them yourself
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 starting point to end the shortest path to achieve the Chinese word.
Packet : 65520759myseg.rar filelist
MySeg\coreDict.dct
MySeg\Dictionary.cpp
MySeg\Dictionary.h
MySeg\Graph.cpp
MySeg\Graph.h
MySeg\MySeg.cpp
MySeg\MySeg.h
MySeg\MySeg.ncb
MySeg\MySeg.rc
MySeg\MySeg.sln
MySeg\MySeg.suo
MySeg\MySeg.vcproj
MySeg\MySegDlg.cpp
MySeg\MySegDlg.h
MySeg\ReadMe.txt
MySeg\resource.h
MySeg\Segment.cpp
MySeg\Segment.h
MySeg\stdafx.cpp
MySeg\stdafx.h
MySeg