選單
×
×
正確!
練習Bellman-Ford 演算法會檢查所有邊多少次? for i in range(self.size@(2)): for u in range(self.size): for v in range(self.size): if self.adj_matrix[u][v] != 0: if distances[u] + self.adj_matrix[u][v] < distances[v]: distances[v] = distances[u] + self.adj_matrix[u][v]
for i in range(self.size-1): for u in range(self.size): for v in range(self.size): if self.adj_matrix[u][v] != 0: if distances[u] + self.adj_matrix[u][v] < distances[v]: distances[v] = distances[u] + self.adj_matrix[u][v] 不正確點選這裡 重新嘗試。 正確!下一個 ❯ |
這將重置所有 43 項練習的分數。
您確定要繼續嗎?