V
 the graph vertex typeE
 the graph edge typepublic interface MinimumWeightedVertexCoverAlgorithm<V,E> extends MinimumVertexCoverAlgorithm<V,E>
MinimumVertexCoverAlgorithm.VertexCover<V>, MinimumVertexCoverAlgorithm.VertexCoverImpl<V>
Modifier and Type  Method and Description 

default MinimumVertexCoverAlgorithm.VertexCover<V> 
getVertexCover(Graph<V,E> graph)
Computes a vertex cover; all vertices are considered to have equal weight.

MinimumVertexCoverAlgorithm.VertexCover<V> 
getVertexCover(Graph<V,E> graph,
Map<V,Double> vertexWeightMap)
Computes a vertex cover; the weight of each vertex is provided in the in the
vertexWeightMap . 
default MinimumVertexCoverAlgorithm.VertexCover<V> getVertexCover(Graph<V,E> graph)
getVertexCover
in interface MinimumVertexCoverAlgorithm<V,E>
graph
 the graphMinimumVertexCoverAlgorithm.VertexCover<V> getVertexCover(Graph<V,E> graph, Map<V,Double> vertexWeightMap)
vertexWeightMap
.graph
 the input graphvertexWeightMap
 map containing nonnegative weights for each vertexCopyright © 2017. All rights reserved.