V
- the graph vertex typeE
- the graph edge typepublic class EdgeBasedTwoApproxVCImpl<V,E> extends Object implements MinimumVertexCoverAlgorithm<V,E>, VertexCoverAlgorithm<V>
MinimumVertexCoverAlgorithm.VertexCover<V>, MinimumVertexCoverAlgorithm.VertexCoverImpl<V>
VertexCoverAlgorithm.VertexCover<V>, VertexCoverAlgorithm.VertexCoverImpl<V>
Constructor and Description |
---|
EdgeBasedTwoApproxVCImpl()
Deprecated.
this constructor will be removed in the next release
|
EdgeBasedTwoApproxVCImpl(Graph<V,E> graph)
Constructs a new EdgeBasedTwoApproxVCImpl instance
|
Modifier and Type | Method and Description |
---|---|
VertexCoverAlgorithm.VertexCover<V> |
getVertexCover()
Finds a 2-approximation for a minimal vertex cover of the specified graph.
|
MinimumVertexCoverAlgorithm.VertexCover<V> |
getVertexCover(Graph<V,E> graph)
Deprecated.
Replaced by
getVertexCover() |
@Deprecated public EdgeBasedTwoApproxVCImpl()
public VertexCoverAlgorithm.VertexCover<V> getVertexCover()
BarYehudaEvenTwoApproxVCImpl
or
ClarksonTwoApproxVCImpl
.
For more details see Jenny Walter, CMPU-240: Lecture notes for Language Theory and Computation, Fall 2002, Vassar College, http://www.cs.vassar.edu/~walter/cs241index/lectures/PDF/approx.pdf.
getVertexCover
in interface VertexCoverAlgorithm<V>
@Deprecated public MinimumVertexCoverAlgorithm.VertexCover<V> getVertexCover(Graph<V,E> graph)
getVertexCover()
BarYehudaEvenTwoApproxVCImpl
or
ClarksonTwoApproxVCImpl
.
For more details see Jenny Walter, CMPU-240: Lecture notes for Language Theory and Computation, Fall 2002, Vassar College, http://www.cs.vassar.edu/~walter/cs241index/lectures/PDF/approx.pdf.
getVertexCover
in interface MinimumVertexCoverAlgorithm<V,E>
graph
- the graphCopyright © 2018. All rights reserved.