@Deprecated public abstract class VertexCovers extends Object
Constructor and Description 

VertexCovers()
Deprecated.

Modifier and Type  Method and Description 

static <V,E> Set<V> 
find2ApproximationCover(Graph<V,E> g)
Deprecated.
Use
EdgeBasedTwoApproxVCImpl ,
ClarksonTwoApproxVCImpl , or
BarYehudaEvenTwoApproxVCImpl instead. 
static <V,E> Set<V> 
findGreedyCover(UndirectedGraph<V,E> g)
Deprecated.
use
GreedyVCImpl instead. 
@Deprecated public static <V,E> Set<V> find2ApproximationCover(Graph<V,E> g)
EdgeBasedTwoApproxVCImpl
,
ClarksonTwoApproxVCImpl
, or
BarYehudaEvenTwoApproxVCImpl
instead.For more details see Jenny Walter, CMPU240: Lecture notes for Language Theory and Computation, Fall 2002, Vassar College, http://www.cs.vassar.edu/~walter/cs241index/lectures/PDF/approx.pdf.
V
 the graph vertex typeE
 the graph edge typeg
 the graph for which vertex cover approximation is to be found.@Deprecated public static <V,E> Set<V> findGreedyCover(UndirectedGraph<V,E> g)
GreedyVCImpl
instead.
The algorithm works on undirected graphs, but can also work on directed graphs when their
edgedirections are ignored. To ignore edge directions you can use
Graphs.undirectedGraph(Graph)
or
AsUndirectedGraph
.
V
 the graph vertex typeE
 the graph edge typeg
 the graph for which vertex cover approximation is to be found.Copyright © 2016. All rights reserved.