node.h

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

#if !defined(AFX_NODE_H__2D7C9B42_AD92_4573_B086_28CB8D327E8B__INCLUDED_)
#define AFX_NODE_H__2D7C9B42_AD92_4573_B086_28CB8D327E8B__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
// node.h : header file
//



/////////////////////////////////////////////////////////////////////////////
// node command target

class node : public CObject
{
	DECLARE_DYNCREATE(node)

	node();           // protected constructor used by dynamic creation

// Attributes
public:

// Operations
public:
	node(int nend,int nnow,int naprent);
	void set(int nend,int nnow,int nparent);
	int nowmul;//现在已分裂位的乘机
	int endpos;//现在已经分裂到 的位数

	int parent;//当前结点的父结点存储在rec 数组中的位置
   
// Overrides
	// ClassWizard generated virtual function overrides
	//{{AFX_VIRTUAL(node)
	//}}AFX_VIRTUAL

// Implementation
public:
	virtual ~node();

	// Generated message map functions
	//{{AFX_MSG(node)
		// NOTE - the ClassWizard will add and remove member functions here.
	//}}AFX_MSG

	//DECLARE_MESSAGE_MAP()
};

/////////////////////////////////////////////////////////////////////////////

//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.

#endif // !defined(AFX_NODE_H__2D7C9B42_AD92_4573_B086_28CB8D327E8B__INCLUDED_)