de.unihalle.informatik.MiToBo.tracking.multitarget.algo
Class GreedyGourmetPartitioning

java.lang.Object
  extended by de.unihalle.informatik.MiToBo.tracking.multitarget.algo.GreedyGourmetPartitioning

@ALDMetaInfo(export=ALLOWED)
public class GreedyGourmetPartitioning
extends Object

greedyGourmet graph partitioning algorithm following:
J. Kutzera, "Gruppierung von LC/MS-Pseudospektren aus multiplen Messungen", Martin Luther University Halle-Wittenberg, 2009, Diploma Thesis

Author:
Oliver Gress

Field Summary
protected  MatchingAdjacencyMatrix adjMatrix
           
protected  boolean maxWeights
           
 
Constructor Summary
GreedyGourmetPartitioning(MatchingAdjacencyMatrix adjMatrix, boolean maximizeWeights, double limit)
          Constructor.
 
Method Summary
 Vector<MTBGraph> computeSubgraphs()
          Compute subgraphs with greedyGourmet algorithm.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

adjMatrix

protected MatchingAdjacencyMatrix adjMatrix

maxWeights

protected boolean maxWeights
Constructor Detail

GreedyGourmetPartitioning

public GreedyGourmetPartitioning(MatchingAdjacencyMatrix adjMatrix,
                                 boolean maximizeWeights,
                                 double limit)
Constructor.

Parameters:
adjMatrix - adjacency matrix of the multipartite graph
maximizeWeights - flag if sum of weights are to be maximized
limit - only edge weights larger (maximize weights) or smaller (minimize weights) are considered
Method Detail

computeSubgraphs

public Vector<MTBGraph> computeSubgraphs()
Compute subgraphs with greedyGourmet algorithm.

Returns:


Copyright © 2010–2015 Martin Luther University Halle-Wittenberg. All rights reserved.