c++多叉树的处理

Posted 2022-12-06 乌托邦2号

struct osg_tree

	double code;
	std::string file_name;
	std::vector<osg_tree> sub_nodes;
;
//多叉树的重组
//获取指定的级别（或修改成数据的判断）
std::vector<int> v_contains_level 15, 16, 18, 20, 22 ; 
void rebuild_tree(osg_tree &v_root)

	std::vector<osg_tree> &v_node = v_root.sub_nodes;
	if (v_node.size() <= 0) return;
	//if (v_node.at(0).sub_nodes.size() <= 0) return;   //叶子节点不在最低点，看数据
	int v_level = get_lvl_num(v_node.at(0).file_name);  //判断级别是否在上述数组中
	if (std::find(v_contains_level.begin(), v_contains_level.end(), v_level) == v_contains_level.end())
	
		std::vector<osg_tree>v_temp = v_node;
		v_node.clear();
		for (auto& v_tree : v_temp) 
			for (auto& v_son : v_tree.sub_nodes) 
				v_node.push_back(v_son);
			
		
		rebuild_tree(v_root);
	
	else 
		for (auto& v_tree : v_node) 
			rebuild_tree(v_tree);
		
	


//多叉树的遍历
void file_flow::traversal_tree(osg_tree &v_root)

	std::queue<osg_tree>v_queue;
	v_queue.push(v_root);
	std::ofstream ofs("test.log", std::ios::app);
	while (!v_queue.empty())
	
		osg_tree &v_tree = v_queue.front();
		ofs << v_tree.file_name << "------" << get_lvl_num(v_tree.file_name) << std::endl;
		//std::cout << v_tree.file_name << "------" << get_lvl_num(v_tree.file_name) << std::endl;
		for (auto& v_node : v_tree.sub_nodes) 
			v_queue.push(v_node);
		
		v_queue.pop();
	
	ofs.close();