Форд-Беллман for БИВТ-20-1

#include <iostream>
#include <limits.h>

using namespace std;

void fordBellman(int graph[][3], int n, int m, int s) {
    int dist[n];
    for (int i = 0; i < n; i++) {
        dist[i] = INT_MAX;
    }
    dist[s] = 0;
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < m; j++) {
            if (dist[graph[j][0]] != INT_MAX && dist[graph[j][0]] + graph[j][2] < dist[graph[j][1]]) {
                dist[graph[j][1]] = dist[graph[j][0]] + graph[j][2];
            }
        }
    }
    for (int i = 0; i < n; i++)
        cout << i << ' ' << dist[i] << '\n';
}

int main() {
    int n = 6, m = 9;
    int graph[][3] = {{0, 1, 3},
                      {0, 2, 9},
                      {1, 2, 5},
                      {4, 1, -1},
                      {2, 4, 2},
                      {2, 3, 1},
                      {3, 4, 2},
                      {3, 5, 6},
                      {4, 5, 4}};
    fordBellman(graph, n, m, 0);
    return 0;
}