antoniolazaro / grafos

grafos

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

psjava (https://psjava.org/algo/Konig_Theorem)

• MinimumVertexCoverAlgorithmInBipartiteGraph algorithm = KonigTheorem.getInstance(HopcroftKarpAlgorithm.getInstance());
• int number = algorithm.calcMinimumVertexCover(g);

GFG

VertexCoverProblem (https://www.geeksforgeeks.org/vertex-cover-problem-set-1-introduction-approximate-algorithm-2/)