Searched refs:best_j (Results 1 – 2 of 2) sorted by relevance
416 int best_i = 1, best_j = 1; in intersectionFinder() local423 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()425 best_j = j; in intersectionFinder()434 if (best_j == 0) { in intersectionFinder()436 } else if (best_j == 2) { in intersectionFinder()439 if (best_i == 1 && best_j == 1) { in intersectionFinder()
521 int best_i = 1, best_j = 1; in intersectionFinder() local528 if (dist[best_i][best_j] > dist[i][j]) { in intersectionFinder()530 best_j = j; in intersectionFinder()539 if (best_j == 0) { in intersectionFinder()541 } else if (best_j == 2) { in intersectionFinder()544 if (best_i == 1 && best_j == 1) { in intersectionFinder()