Function bellman_ford

graph/code17.cpp:21–54

};

void bellman_ford(vector<pair<int, int>> vec[], int v, int source)
{
    vector<node> edges;
    vector<int> dist(v, inf);
    dist[source] = 0;
    for (int i = 0; i < v; i++)
    {
        for (int j = 0; j < vec[i].size(); j++)
        {
            edges.push_back({i, vec[i][j].first, vec[i][j].second});
        }
    }

    for (int i = 0; i < v - 1; i++)
    {
        for (int j = 0; j < edges.size(); j++)
        {
            node curr = edges[j];

            int curr_u = curr.u, curr_v = curr.v, curr_weight = curr.weight;
            if (dist[curr_v] > dist[curr_u] + curr_weight)
            {
                dist[curr_v] = dist[curr_u] + curr_weight;
            }
        }
    }

    cout << "FINAL SHORTEST DISTANCES VIA BELLMAN FORD ALGORITHM: " << endl;
    for (int i = 0; i < dist.size(); i++)
    {
        cout << dist[i] << " ";
    }
    cout << endl;
}

int main()
{