doc/doxygen/graph__min__bp_8h_source.html

 #ifndef GRAPH_MIN_BP_H_INCLUDED_UOFARIZONA_VISION

 #define GRAPH_MIN_BP_H_INCLUDED_UOFARIZONA_VISION


 #include <m_cpp/m_matrix.h>

 #include <m_cpp/m_int_matrix.h>


 namespace kjb {


 #if 0

 template< typename MAT >

 int min_bipartite_match( const MAT&, Int_vector*, MAT::Value_type* );


 template<>

 int min_bipartite_match<Matrix>(

     const Matrix&,

     Int_vector*,

     Matrix::Value_type*

 );


 template<>

 int min_bipartite_match<Int_matrix>(

     const Int_matrix&,

     Int_vector*,

     Int_matrix::Value_type*

 );


 #else


 int min_bipartite_match( const Matrix&, Int_vector*, Matrix::Value_type* );


 #endif


 }

 #endif /* GRAPH_MIN_BP_H_INCLUDED_UOFARIZONA_VISION */

m_matrix.h
Definition for the Matrix class, a thin wrapper on the KJB Matrix struct and its related functionalit...

kjb::Matrix::Value_type
double Value_type
data type of the elements
Definition: m_matrix.h:108

kjb::Int_matrix::Value_type
int Value_type
data type of the elements
Definition: l_int_matrix.h:83

m_int_matrix.h

kjb::min_bipartite_match
int min_bipartite_match(const Matrix &weights, Int_vector *assignment, Matrix::Value_type *cost)
solve a matching with minimum cost in a complete bipartite graph.
Definition: graph_min_bp.cpp:299