cl1p.net - The internet clipboard

cl1p.net/ginger

This cl1p will be deleted in in 15 days.

class Solution {
public:
    int findShortestCycle(int n, vector<vector<int>>& edges) {
        int length=INT_MAX;
        unordered_set<int> st;
        
        int m=edges.size();
             vector<vector<int>>adj(n);
        for(int i=0;i<m;i++){
            int f=edges[i][0];
            int s=edges[i][1];
            adj[f].push_back(s);
            adj[s].push_back(f);
        }
    for(int i=0;i<n;i++){

vector<int> dist(n,-1);
       
        dist[i]=0;
        queue <pair<int,int>> q;
   
      
        q.push({i,-1});
        while(!q.empty()){
            int node=q.front().first;
            int parent=q.front().second;
            q.pop();
            for(auto it:adj[node]){
                if(dist[it]==-1){
                    dist[it]=dist[node]+1;
                    q.push({it,node});
                }
                else if(it!=parent){
                    length=min(length,dist[it]+dist[node]+1);
                }

}
             }
    }

return(length==INT_MAX? -1:length);
    }
};