Datastructures-and-Algorithms-/TSP.cpp at main · harhitosw/Datastructures-and-Algorithms- · 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include<bits/stdc++.h>
# define  INF INT_MAX
using namespace std;
vector<vector<int>> make_new_node(vector<vector<int>>vp,int r,int c){
    for(int i=0;i<vp.size();i++){
        if(i==r){
            for(int j=0;j<vp[0].size();j++){
                vp[i][j]=INF;
            }
        }
        else{
            continue;
        }
    }
    for(int i=0;i<vp[0].size();i++){
        if(i==c){
            for(int j=0;j<vp[0].size();j++){
                vp[j][i]=INF;
            }
        }
        else{
            continue;
        }
    }
        vp[c][r]=INF;
       return vp;

}
pair<vector<vector<int>>,int> reduce_matrix(vector<vector<int>>&v){
    // first we reduce from the row
    int cost=0;
    vector<vector<int>>vp=v;
    for(int i=0;i<vp.size();i++){
        int mini=*min_element(vp[i].begin(),vp[i].end());
        for(int j=0;j<vp[0].size();j++){
          if(vp[i][j]==INT_MAX){
             continue;
          }
          else{
            vp[i][j]-=mini;
          }
        }
        cost+=mini;
    }
    // secondly we traverse a column
    for(int i=0;i<vp[0].size();i++){
       // auto it=find(vp[i].begin(),vp[i].end(),0);
        int min_col=INT_MAX;
        for(int k=0;k<vp.size();k++){
            min_col=min(min_col,vp[k][i]);
        }
        cout<<"MIn for col"<<min_col<<endl;
        if(min_col!=0){
            for(int j=0;j<vp.size();j++){
                if(vp[j][i]==INT_MAX){
                    continue;
                }
                else{
                    vp[j][i]-=min_col;
                }
            }
            cost+=min_col;
        }
        else {
            continue;
        }

    }
    pair<vector<vector<int>>,int> ans=make_pair(vp,cost);
     return ans;
}
int main()
{
    vector<vector<int>>v={
        {INF,20,30,10,11},
        {15,INF,16,4,2},
        {3,5,INF,2,4},
        {19,6,18,INF,3},
        {16,4,7,16,INF}
    };

   vector<vector<int>> tmp=make_new_node(v,2,3);
     for(int i=0;i<tmp.size();i++){
        for(int j=0;j<tmp[0].size();j++){
            cout<<tmp[i][j]<<" ";
        }
        cout<<endl;
     }
    return 0;
}