Exercise:

How many times do the Bellman-Ford algorithm check all edges?

for i in range(self.size
w3exercise_input_no_0
):
    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]