cprogramtested.cpp

这是一个遗传算法

// Triangle.cpp : implementation file
//

#include "stdafx.h"
#include "CProgramTested.h"
#include "iostream.h"



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

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


CProgramTested::CProgramTested()
{
	if ((PathValues=(unsigned*)malloc(6*sizeof(unsigned)))==NULL) 
	{
		cout<<"malloc:out of memory making pathvalues!\n";
		exit(-1);
	}
}

CProgramTested::~CProgramTested()
{
	free(PathValues) ;
}


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


/////////////////////////////////////////////////////////////////////////////
// CProgramTested message handlers
unsigned CProgramTested::Triangle(unsigned SideA,unsigned SideB,unsigned SideC)
{
	//被测函数
	unsigned sum=0;
	int j;
	for(j=0;j<6;j++)
	{
		PathValues[j]=0;
	}
	
	if ((SideA + SideB > SideC) && (SideB + SideC > SideA)
		&& (SideC + SideA > SideB))
	{ 
		PathValues[0] = 1;
		if ((SideA != SideB) && (SideB != SideC)
			&& (SideC != SideA))
		{ 
			PathValues[1] = 1;
		}
		else
		{
			PathValues[2] = 1;
			if (((SideA ==SideB) && (SideB != SideC))
				|| ((SideB == SideC) && (SideC != SideA))
				|| ((SideC == SideA) && (SideA != SideB)))
			{ 
				PathValues[3] = 1;
			}
			else
			{ 
				PathValues[4] = 1;
			}
		}
	}
	else 
	{
		PathValues[5]=1;
	}	

	for(j=0;j<6;j++)
	{
		sum+=PathValues[j];
	}

	//如果这一代种群能够覆盖所有的分支则找到最终结果了。
	return sum; 
}