How to stop three loopings for in C

Question

Rstou trying to implement the AI ordered search algorithm and I have reached a point where I need to stop all loopings if I have found the NODE searched.

Look what I did, but it doesn’t work. I know that in PHP I could use break 3 to finish the three iterations, but in C does not work or found on the internet:

for(int i=0;i<N;i++) {
   for(int j=0;j<N;j++){
      if(entra){
         soma = 0;
         custo = 99999;
         for(int k=0;k<N;k++){
            if (abertos[k] > 0){
                //se o nó estiver em fechados, pula para próxima iteração.
                if (fechados[k]==1){
                    continue;
                }
                if(mCusto[k] < custo){
                    custo = mCusto[k];
                    posatual = k;
                }

                if (posatual+1 == dest){ //Se chegou ao destino então para o looping.
                    printf("Sucesso\n\n");
                    break;
                    break;
                    break;
                }
            }
            soma += abertos[k];
            printf("\nsoma = %d\n",soma);
            fechados[posatual] = 1; //coloca o nó escolhido em fechados.
        } //fim laço k

Answer 1

I found this solution in stackoverflow in English, there are other.

for(int i = 0; i < 1000; i++) {
    for(int j = 0; j < 1000; i++) {
        if(condition) {
            goto end;
    }
} 

end:

Answer 2

The first answer that came to mind, I’m pretty sure there’s some more sophisticated way to do that.

int i, j, k;
int stop = 0;

for(i = 0; i < 10; ++i) {
    for(j = 0; j < 10; ++j) {
        for(k = 0; k < 10; ++k) {
            if(/* Alguma condição aleatória*/) {
                stop = 1;
                break;
            }
        }
        if(stop) {
            break;
        }
    }
    if(stop) {
        break;
    }
}

Other than that, all I remember is goto, but the same has discouraged use in C.

Answer 3

By seeing a function with so many levels of identation one within another the first thing that comes to mind is: this function is doing too much.

In an ideal environment, each function should have a very specific and isolated functionality and rely on other more trivial functions to make its operation. For cases like yours it is worth reviewing the organization of the code and do some Refactoring to split the task into more than one function.

---

More directly answering the question: There is a magic operation capable of breaking as many levels as needed: return. If the goal is to search for some node, you can do so:

int findNode(int a, int b, int c, int d, .../*stuff you need*/) {
    for (i = 0; i < 10; ++i) {
        for (j = 0; j < 10; ++j) {
            for (k = 0; k < 10; ++k) {
                if (/*algo*/)
                    return a+b*c-d;
            }
        }
    }
}

// Mais para frente...
int dest = findNode(34, 64, aaa, y+f);
fazerAlgoCom(dest);