bellman_ford.cpp

for (int i = 0; i < N; i++) {
	dist[i] = INFINITY;
}

dist[start] = 0;

for (int k = 0; k < N - 1; k++) {
    for (int i = 0; i < N; i++) {
        for (int e = 0; e < adj[i].size(); e++) {
            int j = adj[i][e].vertex;
            int w = adj[i][e].weight;
            
            dist[j] = min(dist[j], w + dist[i]);
        }
    }
}