Function dijstra1

graph/code16.cpp:22–57

without priority queue

// without priority queue
void dijstra1(vector<pair<int, int>> vec[], int v, int source)
{
    vector<bool> mst(v, false);
    vector<int> dist(v, INT_MAX);
    dist[source] = 0;

    for (int i = 0; i < v; i++)
    {
        int u = -1;
        for (int j = 0; j < dist.size(); j++)
        {
            if (mst[j] == false && (u == -1 || dist[j] < dist[u]))
            {
                u = j;
            }
        }
        mst[u] = true;
        for (int j = 0; j < vec[u].size(); j++)
        {
            int adjacent = vec[u][j].first;
            int adj_weight = vec[u][j].second;

            if (mst[adjacent] == false && dist[adjacent] > dist[u] + adj_weight)
            {
                dist[adjacent] = dist[u] + adj_weight;
            }
        }
    }

    cout << "Minimum distances(without priority queue) are: " << endl;
    for (int i = 0; i < dist.size(); i++)
    {
        cout << dist[i] << " ";
    }
    cout << endl;
}

struct mycmp
{