mid.cpp

用分支界限法实现的n后问题 vc++ 语言效率很好

// mid.cpp : implementation file
//

#include "stdafx.h"
#include "nqueue.h"
#include "mid.h"

#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif

/////////////////////////////////////////////////////////////////////////////
// mid

IMPLEMENT_DYNCREATE(mid, CCmdTarget)

mid::mid()
{
}

mid::~mid()
{
}


//BEGIN_MESSAGE_MAP(mid, CCmdTarget)
	//{{AFX_MSG_MAP(mid)
		// NOTE - the ClassWizard will add and remove mapping macros here.
	//}}AFX_MSG_MAP
//END_MESSAGE_MAP()

/////////////////////////////////////////////////////////////////////////////
// mid message handlers

mid::mid(int mrow, int mcolumn, int mprior)
{
row=mrow;
column=mcolumn;
prior=mprior;
}
void mid::operator = (mid *a)
{
	column=a->column;
	prior=a->prior;
	row=a->prior;
}