NAME

hungarian - Approximates the best matching of a weighted bipartite graph.

SYNOPSIS

#include "graph/hungarian.h"

Example compile flags (system dependent):
  -DLINUX_X86_64 -DLINUX_X86_64_OPTERON  -DGNU_COMPILER 
   -I/home/kobus/include
   -L/home/kobus/misc/load/linux_x86_64_opteron -L/usr/lib/x86_64-linux-gnu
  -lKJB                               -lfftw3  -lgsl -lgslcblas -ljpeg  -lSVM -lstdc++                    -lpthread -lSLATEC -lg2c    -lacml -lacml_mv -lblas -lg2c      -lncursesw 


int hungarian
(
	const Matrix *cost_mp,
	Int_vector **row_assignment_vpp,
	double *cost_ptr
);

DESCRIPTION

This approximately solves a bipartite graph matching problem for a graph with real weights, by approximating the weights with large integers, and using routine int_hungarian() -- please see the documentation for that function. The input and output interfaces correspond closely. The return value is ERROR if unsuccessful (e.g., if memory allocation fails), otherwise NO_ERROR. A related function that requires C++ is min_bipartite_match() found in lib/graph_cpp.

int_hungarian

DISCLAIMER

This software is not adequatedly tested. It is recomended that results are checked independantly where appropriate.

AUTHOR

Kobus Barnard

DOCUMENTER

Andrew Predoehl