下面 Dijkstra 算法中，横线处应填入：
for (int i = 1; i <= n; i++) {
int minn = inf, minx;
for (int j = 1; j <= n; j++) {
if (__________) { // 在此处填入选项
minn = dis[j];
minx = j;
}
}
cheak[minx] = 1;
// 用 minx 松弛邻居 ...
}
- A. dis[j] > minn && cheak[j] == 0
- B. dis[j] < minn && cheak[j] == 0
- C. dis[j] >= minn && cheak[j] == 0
- D. dis[j] < minn && cheak[j] != 0
正确答案：B