segment.h

最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图

#ifndef SEGMENT 
#define SEGMENT
#pragma once

	

#include "dictionary.h"
#include "graph.h"


typedef struct tagNODE			//用于储存中间结果的结构
{
	int nRoute;					//路由
	int nDistance;				//距离
	int bMarked;				//是否被包含入目标点集
}NODE;

class CSegment
{
private:
	char m_sAtom[MAX_SENTENCE_LEN][WORD_MAXLENGTH];
	int m_nAtomLen[MAX_SENTENCE_LEN];
	BOOL m_bAtomChinese[MAX_SENTENCE_LEN];
	int m_nAtomNum;

	NODE m_Route[MAX_SENTENCE_LEN];
	
	CGraph m_Graph;
	CDictionary m_Dict;
public:
	char m_sSentence[MAX_SENTENCE_LEN];
	char m_sResult[MAX_SENTENCE_LEN*2];

	CSegment(void);
	virtual ~CSegment(void);

	void AtomSegment();	
	void GenerateGraph();
	void ShortPath();
	void GenerateResult();
	void CleanUp();


};
#endif