node.cpp

k乘积问题的分支界限法实现, 并且给出了划分结果 ,很好理解

// node.cpp : implementation file
//

#include "stdafx.h"
#include "kchengji.h"
#include "node.h"

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

/////////////////////////////////////////////////////////////////////////////
// node

IMPLEMENT_DYNCREATE(node, CCmdTarget)

node::node()
{
}

node::~node()
{
}


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

/////////////////////////////////////////////////////////////////////////////
// node message handlers

void node::set(int nend, int nnow, int nparent)
{
endpos=nend;
nowmul=nnow;
parent=nparent;
}

node::node(int nend, int nnow, int nparent)
{
endpos=nend;
nowmul=nnow;
parent=nparent;
}
/*
void node::operator =(node *a)
{
endpos=a->endpos;
nowmul=a->nowmul;
parent=a->parent;

}*/

/*
void node::operator =(node *a)
{
endpos=a->endpos;
nowmul=a->nowmul;
parent=a->parent;
}
*/