This project was to implement a solution to the NP-Complete Vertex Cover problem: finding the minimum set of vertices required to form a cover of a given graph. A cover fits a graph when all vertices in the graph have at least 1 link to a vertex contained within the cover set.
njensen-git/VertexCover
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|