Basic-Datastructre/Dijkstra Algorithm at master · HusainRF/Basic-Datastructre · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cout << "Enter number of nodes: ";
    cin >> n;
    n++;


    vector<vector<int>> adj_matrix(n, vector<int> (n));

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << "Enter weight between" << i << " and " << j;
            int x;
            cin >> x;
            adj_matrix[i][j] = x;
        }
    }
    vector<int> distance(n);
    vector<bool> visisted(n);

    for (int i = 0; i < n; i++) {
        visisted[i] = false;
        if(adj_matrix[5][i]==0)
        {
            distance[i] = INT_MAX;
        }
        else
        {
            distance[i] = adj_matrix[5][i];
        }

    }

    distance[1] = 0;
    visisted[1] = true;

    for (int i = 2; i < n; i++) {
        int min1 = INT_MAX;
        for(int j = 1; j < n; j++)
        {
            if(adj_matrix[i][j]!=INT_MAX && visisted[j]==false)
            {
                min1 = min(min1, adj_matrix[i][j]);
            }
        }
        visisted[min1] = true;

        for(int j = 1; j < n; j++)
        {
            if(distance[j]>distance[min1]+adj_matrix[min1][j])
            {
                distance[j] = distance[min1]+adj_matrix[min1][j];
            }
        }
    }

    cout << distance[n];


    return 0;
}