Type Alias VertexCoverT 

pub type VertexCoverT<G = SimpleGraph, W = i32> = GraphProblem<VertexCoverConstraint, G, W>;

Vertex Cover problem using the generic template.

Find a minimum weight set of vertices that covers all edges.

Type Parameters

• G: Graph type (default: SimpleGraph)
• W: Weight type (default: i32)

Aliased Type

pub struct VertexCoverT<G = SimpleGraph, W = i32> { /* private fields */ }