TUM CCSM Commons

Package edu.tum.cs.commons.algo

Basic algorithms.

See:
          Description

Interface Summary
MaxWeightMatching.IWeightProvider<N1,N2> A class providing the weight for a connection between two nodes.
 

Class Summary
Diff<T> Implementation of the diff algorithm described in: E.W.
Diff.Delta<T> Objects of this class describe the additions and deletions used to transform between two words.
MaxWeightMatching<N1,N2> A class for calculating maximum weighted matching using an augmenting path algorithm running in O(n^3*m), where n is the size of the smaller node set and m the size of the larger one.
ObjectUnionFind<T> Implementation of a simple union find data structure working on arbitrary objects.
UnionFind Implementation of a simple union find data structure.
UnionFindWithSize Implementation of a simple union find data structure.
 

Package edu.tum.cs.commons.algo Description

Basic algorithms.


TUM CCSM Commons

TUM CCSM Commons - 2.7