Vertex cover problem

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’ or ‘v’ is in the vertex cover.
Please let me work on this issue as a part of LGMSOC 21
Question Link : https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/

### Programming language

- [ ] C
- [x] C++
- [ ] Java
- [ ] Python

Read the linked GeeksforGeeks vertex-cover description first, then inspect the repository’s existing C++ data-structure and graph examples to find the appropriate location and conventions. Done means adding a working C++ implementation of the stated vertex-cover problem in the project’s expected format and verifying it against representative graph cases.

Written by the indexing model from the issue text.