下面 Floyd 算法中，松弛处横线应填入：
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (map[i][j] > map[i][k] + map[k][j])
________; // 在此处填入选项
- A. map[i][j] = map[i][k] + map[k][j]
- B. map[i][k] = map[i][j] - map[k][j]
- C. map[i][j] = map[i][k] - map[k][j]
- D. map[k][j] = map[i][j] - map[i][k]
正确答案：A