Distance from the Source (Bellman-Ford Algorithm)

class Solution {
  public:
    /*  Function to implement Bellman Ford
    *   edges: vector of vectors which represents the graph
    *   S: source vertex to start traversing graph with
    *   V: number of vertices
    */
    vector<int> bellman_ford(int V, vector<vector<int>>& edges, int S) {
        vector<int> dist(V, 1e8);
        dist[S] = 0;
        for(int i=0;i<V-1;i++){
            for(auto it: edges){
                auto u = it[0];
                auto v = it[1];
                auto wt = it[2];
                if(dist[u] != 1e8 && dist[u] + wt < dist[v]) dist[v] = dist[u] + wt;
            }
        }
        // nth relaxation to check the negetive cycle
        for(auto it: edges){
            auto u = it[0];
            auto v = it[1];
            auto wt = it[2];
            if(dist[u] != 1e8 && dist[u]+wt<dist[v]) return {-1};
        }
        return dist;
    }
};