endrov.util.graphs
Class GreedyMaximumWeightedMatching<V,E>

java.lang.Object
  endrov.util.graphs.GreedyMaximumWeightedMatching<V,E>

public class GreedyMaximumWeightedMatching<V,E>
extends java.lang.Object

Calculate the maximum weighted matching i.e. the subset of edges maximizing total weight, such that none of the vertices are connected to more than one other vertex. This is a greedy approximation

Constructor Summary

GreedyMaximumWeightedMatching(org.jgrapht.Graph<V,E> graph)

Method Summary

java.util.Collection<E>

getEdges() Get optimal subset of edges

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GreedyMaximumWeightedMatching

public GreedyMaximumWeightedMatching(org.jgrapht.Graph<V,E> graph)

Method Detail

getEdges

public java.util.Collection<E> getEdges()

Get optimal subset of edges