Question:
How to determine the smallest possible size of a vertex cover using C++

Summary

Let’s assume:

Integer- n

Function- vertexCover()


Solution


//User function Template for C++


class Solution{

    public:

 int vertexCover(int n, vector<pair<int, int>> &edges) {

            int ans=18;

            for(int bit=0;bit<(1<<n);bit++){

                int m=edges.size();

                for(auto i:edges){

                    int x=i.first,y=i.second;

                    x--,y--;

                  if((bit&(1<<x))|(bit&(1<<y)))

                     m--;

                  else break;

                }

            if(m==0) ans=min(ans,__builtin_popcount(bit));

            }

        return ans;

    }

};



Suggested blogs:

>Build a minimal ASP.Net Core API with Android Studio for Mac

>Build an Electron application from scratch

>Build Progressive Web Apps with Angular

>Building a web application with Angular and Firebase

>Building Web API using ASP.NET (C#)

>Built Web API using ASP.NET (C#)


Nisha Patel

Nisha Patel

Submit
0 Answers