决策树的c++实现

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include "jcs.h"

using namespace std;

void predict(jctree&jc,vector<string>&hind, vector<string>&attr);

void predict1(jctree jc, vector<int>&a, vector<string>&hind,vector<string>&attr);
jctree buildj(vector<vector<int>>& a, vector<string>& b,vector<string>&hind,vector<int>&flag);

int main()

{
	vector<string> attr = { "outlook", "temperature", "humidity", "wind" };

	vector<string> hind;
	/*
	outlook :       sunny 1,overcast 2,rain 3
	temperature:    hot 1,mild 2,cool 3
	humidity:       high 1,normal 2
	wind:           week 1,strong 2

	yes 0,  no 1
	*/

	vector<vector<int>> a = { { 1, 1, 1, 1,1 }, { 1, 1, 1, 2 ,1}, { 2, 1, 1, 1 ,0}, { 3, 2, 1, 1 ,0}, { 3, 3, 2, 1 ,0}, { 3, 3, 2, 2,1 }, { 2, 3, 2, 2 ,0}, { 1, 2, 1, 1 ,1}, { 1, 3, 2, 1 ,0}, { 3, 2, 2, 1 ,0}, { 1, 2, 2, 2,0 }, { 2, 2, 1, 2,0 }, { 2, 1, 2, 1 ,0}, { 3, 2, 1, 2,1 } };
	vector<int> b = { 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1 };

	vector<int>flag(4, 0);
	jctree j = buildj(a, attr,hind,flag);
	show(j);
	
	predict(j,hind,attr);

	system("pause");
	return 0;
}

jctree buildj(vector<vector<int>> &a, vector<string>& b, vector<string>&hind,vector<int>&flag)
{
	if (a.size() <= 0 || a[0].size()-1 <= 0)
	{
		jctree c("error", true, -1);
		return c;
	}

	vector<int>classlist;
	for (vector<vector<int>>::size_type i = 0; i < a.size(); i++)
	{
		classlist.push_back(a[i][a[0].size() - 1]);
	}
	
	//结果只有一种
	if (count(classlist.begin(), classlist.end(), classlist[0]) ==a.size())
	{
		jctree c("",true