|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object edu.umd.cfar.lamp.viper.util.DataMatrices
A variety of static methods for manipulating data matrices, including a transpose function and a function for computing the optimal assignment via the Hungarian algorithm. The implementation of the Hungarian algorithm is as Knuth presented in his book of graph algorithms in CWEB.
Nested Class Summary | |
static interface |
DataMatrices.GetCost
This interface is for functor objects that uses the nodes of a DataMatrix2d as weighted edges of a
bipartite graph. |
static class |
DataMatrices.PassThrough
Assumes Object is an instance of Number, and calls its getLong() method to determine the node cost. |
Constructor Summary | |
DataMatrices()
|
Method Summary | |
static java.util.List |
assign(DataMatrix2d mtx,
DataMatrices.GetCost c)
Returns the data elements in the data matrix that minimize the total cost of the bipartite graph whose edges are the weighted using the objects in the matrix mtx using
the cost function c . |
static DataMatrix2d |
transpose(DataMatrix2d mtx)
Returns a version of the matrix, flipped. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public DataMatrices()
Method Detail |
public static DataMatrix2d transpose(DataMatrix2d mtx)
mtx
- the matrix to transpose
m.get(x,y) == transpose(m).get(y,x)
public static java.util.List assign(DataMatrix2d mtx, DataMatrices.GetCost c)
mtx
using
the cost function c
.
mtx
- the matrix to be used as the edge list of the
bigraphc
- the cost function, called on each element of mtx
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |