public static enum Grph.MinVertexCoverAlgorithm extends java.lang.Enum<Grph.MinVertexCoverAlgorithm>
INTEGER_PROGRAMMING
solves the problem via a
translation into an integer program and an external solver; BRUTE_FORCE
is a naive algorithm that tests all
subsets and gives poor performances on large graphs; BRANCHING
is a recursive branching algorithm based on
the rule: "in any vertex cover, either take {v} or its neighbors"; NIEDERMEIER
is an improved branching algorithm, with
good performances.
Enum Constant and Description |
---|
BRANCHING |
BRUTE_FORCE |
INTEGER_PROGRAMMING |
NIEDERMEIER |
Modifier and Type | Method and Description |
---|---|
static Grph.MinVertexCoverAlgorithm |
valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name.
|
static Grph.MinVertexCoverAlgorithm[] |
values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
public static final Grph.MinVertexCoverAlgorithm BRUTE_FORCE
public static final Grph.MinVertexCoverAlgorithm INTEGER_PROGRAMMING
public static final Grph.MinVertexCoverAlgorithm BRANCHING
public static final Grph.MinVertexCoverAlgorithm NIEDERMEIER
public static Grph.MinVertexCoverAlgorithm[] values()
for (Grph.MinVertexCoverAlgorithm c : Grph.MinVertexCoverAlgorithm.values()) System.out.println(c);
public static Grph.MinVertexCoverAlgorithm valueOf(java.lang.String name)
name
- the name of the enum constant to be returned.java.lang.IllegalArgumentException
- if this enum type has no constant with the specified namejava.lang.NullPointerException
- if the argument is null