graph.cpp

来自「最短路径法分词程序。将中文句子经过原子切分后生成一个有向无环图」· C++ 代码 · 共 41 行

#include "StdAfx.h"
#include ".\graph.h"

CGraph::CGraph(void)
{
	m_bEmpty=TRUE;
}

CGraph::~CGraph(void)
{
	CleanUp();
}
void CGraph::Init(int n)
{
	int i;
	if (!m_bEmpty)
		delete m_pBuffer;
	m_nNodes=n;
	m_pBuffer=new int[n*n];
	for (i=0;i<n*n;i++)
		m_pBuffer[i]=MYINFINITE;
	
}
void CGraph::CleanUp()
{
	if (!m_bEmpty)
		delete m_pBuffer;	
	m_bEmpty=TRUE;
}
int CGraph::Get(int m,int n)
{
	if (m<m_nNodes && n<m_nNodes)
		return m_pBuffer[m*m_nNodes+n];
	else
		return -1;
}
void CGraph::Let(int m,int n,int nValue)
{
	if (m<m_nNodes && n<m_nNodes)
		m_pBuffer[m*m_nNodes+n]=nValue;
}