manyaprroaches (https://github.com/bonhamdaniel/java-vertex-cover)
- vertexCover.bruteForce();// runs Brute Force approach
- vertexCover.optimizedBruteForce();// runs Optimized Brute Force approach
- vertexCover.firstSolution();// runs First Solution approach
- vertexCover.greedyCover();// runs Greedy Cover approach
- vertexCover.approxCover();// runs Approx Cover approach
- MinimumVertexCoverAlgorithmInBipartiteGraph algorithm = KonigTheorem.getInstance(HopcroftKarpAlgorithm.getInstance());
- int number = algorithm.calcMinimumVertexCover(g);