回溯算法

http://blog.csdn.net/metasearch/article/details/5849607

 

 

/*定义解空间x[N]*/
void backtracking(int cur)
{
    if(cur == N) print(x);
    for(i = 0; i < N; i++){/*遍历解i*/
        x[cur] = soultion(i);/*当前解*/
        if(next(cur) == YES)/*如果没有剪裁回溯步骤,则为普通穷举*/
        backtracking(cur + 1);
    }
}
emun next(int x)
{
    if(check(x)) return YES;/*检查当前解空间,到cur为止*/
    else return NO;
}