computecounts.h

来自「贝叶斯优化算法是一种新的演化算法」· C头文件 代码 · 共 20 行

#ifndef _computeCounts_h_
#define _computeCounts_h_

#include "population.h"

int computeCounts(int *pos, 
		  int n, 
		  Population *population, 
		  long *count);

int computeCountsForList(int node, 
			 int *list, 
			 int numList, 
			 int *pos, 
			 int n, 
			 Population *population, 
			 long **count);

#endif