V- the graph vertex type
E- the graph edge type
public class BarYehudaEvenTwoApproxVCImpl<V,E> extends Object implements MinimumWeightedVertexCoverAlgorithm<V,E>
BarYehudaEvenTwoApproxVCImpl. TODO: Remove the UndirectedSubgraph dependency! Querying vertex degrees on these graphs is actually slow! This does affect the runtime complexity. Better would be to just work on a clone of the original graph!
|Constructor and Description|
|Modifier and Type||Method and Description|
Computes a vertex cover; the weight of each vertex is provided in the in the
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public MinimumVertexCoverAlgorithm.VertexCover<V> getVertexCover(UndirectedGraph<V,E> graph, Map<V,Double> vertexWeightMap)
Copyright © 2016. All rights reserved.