Function shortest_dist

graph/code13.cpp:63–108

}

void shortest_dist(vector<pair<int, int>> vec[], vector<int> &sort_vec, int v, int source)
{
    vector<int> dist(v, INT_MAX);
    dist[source] = 0;

    int pos = -1;

    for (int i = 0; i < sort_vec.size(); i++)
    {

        // cout << sort_vec[i] << " ";
        if (sort_vec[i] == source)
        {
            pos = i;
            break;
        }
    }

    // cout<<"pos: "<<pos<<endl;

    for (int i = pos; i < sort_vec.size(); i++)
    {
        int curr = sort_vec[i];

        // cout << "curr: " << curr << endl;

        for (int j = 0; j < vec[curr].size(); j++)
        {
            int adjacent = vec[curr][j].first;

            // cout << adjacent << endl;

            if (dist[adjacent] > dist[curr] + vec[curr][j].second)
            {
                dist[adjacent] = dist[curr] + vec[curr][j].second;
            }
        }
    }

    cout << "CHECK SHORTEST DISTANCE:" << endl;
    for (int i = 0; i < dist.size(); i++)
    {
        cout << dist[i] << " ";
    }
    cout << endl;
}

int main()
{