split.cpp

一个聚类算法用K-mean处理后迭代

#include "head.h"
#include <vector>
using namespace std;

void split( 
					deque<lable_instance>::iterator begin, deque<lable_instance>::iterator end,
						vector< vector<instance> > &class_vector)
{
	
	deque<lable_instance>::iterator p;
		
	
	instance tmp;
	int i;
	
		
		for(p=begin; p<end; p++) {
			
				i=(*p).lable;
				tmp= (*p).att;
				class_vector[i].push_back(tmp);
			
		}
		
		
			
}