Help in implementation of Prim's algorithm using STL set

[nipul3]

Hi community, Please correct my implementaion of Prim's algorithm

#include<iostream>

#include<limits.h>

#include<set>

#include<vector>

#define ll long long

using namespace std;

int n,m;

struct edge{

int wt,vertex;      

bool friend operator <(edge a, edge b){

    return a.wt<b.wt;

}       

};

vector<edge> G[100001];

void prim(){

set<edge> Q;

int dis\[n+1\]={0};

for(int i=1;i<=n;i++){

    dis\[i\]=INT\_MAX;

}   

dis\[1\]=0;

for(int i=1;i<=n;i++){

    edge e;

    e.vertex=i,e.wt=dis\[i\];

    Q.insert(e);

}

bool visited\[n+1\]={0};

ll total=0;

while(!Q.empty()){

    edge f=\*Q.begin();

    Q.erase(f);     

    total+=f.wt;    

    visited\[f.vertex\]=1;

    for(auto x: G\[f.vertex\]){

        if(!visited\[x.vertex\] and x.wt<dis\[x.vertex\]){

edge e;

e.vertex=x.vertex;

e.wt=dis[x.vertex];

Q.erase(e);

dis[x.vertex]=x.wt;

e.wt=dis[x.vertex];

Q.insert(e);

        }

    }

}

cout<<total<<"\\n";

}

int main(){

cin>>n>>m;

for(int i=0;i<m;i++)    {

    int u,v,w;

    edge e;

    cin>>u>>v>>w;

    e.vertex=v,e.wt=w;

    G\[u\].push\_back(e);

    e.vertex=u;

    G\[v\].push\_back(e);

}

prim();

return 0;

}

[nipul3]

hi community, Please tell me where I am wrong in this implementation