Searched refs:N_FL (Results 1 – 1 of 1) sorted by relevance
7327 for (i=0; i < N_FL; ++i) { in SUMA_Next_Best_Seed()7348 for (i=0; i < N_FL; ++i) { in SUMA_Next_Best_Seed()7410 while (*N_visited <= N_FL) { in SUMA_Take_A_Hike()7561 int *FL, int N_FL, int N_Node, in SUMA_Make_Edge_List_eng() argument7579 fprintf(SUMA_STDERR,"%s: %d Facesets to work with.\n", FuncName, N_FL); in SUMA_Make_Edge_List_eng()7581 if (!N_FL) { in SUMA_Make_Edge_List_eng()7599 for (i=1; i<3*N_FL; ++i) if (N_Node_Alloc < FL[i]) N_Node_Alloc=FL[i]; in SUMA_Make_Edge_List_eng()7603 SEL->N_EL = 3 * N_FL; in SUMA_Make_Edge_List_eng()7633 for (i=0; i< N_FL; ++i) {/* begin, form edge list */ in SUMA_Make_Edge_List_eng()8226 for (i=0; i< N_FL; ++i) { in SUMA_FaceSet_Edge_Neighb()[all …]