mascoptDev.algos.graph
Class PadbergRao

java.lang.Object
  |
  +--mascoptDev.algos.graph.PadbergRao

public class PadbergRao

extends Object

Provides an algorithm to find blossom inequalities which are violated or prove that no such inequality exists We have as entry : one graph G, one map s <=> b(s), one solution x of the LP,which is a map e <=> x(e), a map e <=> C(e) where C(e) is the capacity of the edge e

Field Summary

EdgeSet	Tsol
VertexSet	Wsol

Constructor Summary

PadbergRao(Graph G, HashMap xmap, HashMap bmap, HashMap dmap)

Method Summary

void	constructGraphs()
boolean	searchMinCut()

Methods inherited from class java.lang.Object

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

Field Detail

Wsol

public VertexSet Wsol

Tsol

public EdgeSet Tsol

Constructor Detail

PadbergRao

public PadbergRao(Graph G,
                  HashMap xmap,
                  HashMap bmap,
                  HashMap dmap)

Method Detail

constructGraphs

public void constructGraphs()

searchMinCut

public boolean searchMinCut()