форд белман

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

struct ed{
    int fr, to, w;
};

vector <ed> G;
vector <int> d;
int n,m;
const int inf  = 2e9;

int main()
{
    ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	G.resize(m);
	d.assign(n, inf);
	for (int i = 0; i < m;++i){
        cin>>G[i].fr>>G[i].to>>G[i].w;
	}
	bool ch = 1;
	d[0] = 0;
	while (ch){
        ch = 0;
        for (int i = 0; i < m;++i){
            if (d[G[i].fr] == inf) continue;
            if (d[G[i].to] > d[G[i].fr] + G[i].w){
                ch = 1;
                d[G[i].to] = d[G[i].fr] + G[i].w;
            }
        }
	}
	cv(d);
}