contrib/mul/mmn/mmn_solve.h
Go to the documentation of this file.
00001 #ifndef mmn_solve_h_
00002 #define mmn_solve_h_
00003 //:
00004 // \file
00005 // \brief Find choice of nodes which minimises Markov problem
00006 // \author Tim Cootes
00007 
00008 #include <vnl/vnl_vector.h>
00009 #include <mmn/mmn_arc.h>
00010 #include <mmn/mmn_dependancy.h>
00011 #include <vcl_vector.h>
00012 
00013 double mmn_solve(const vcl_vector<vnl_vector<double> >& node_cost,
00014                  const vcl_vector<vnl_matrix<double> >& pair_cost,
00015                  const vcl_vector<mmn_dependancy>& deps,
00016                  unsigned max_n_arcs,
00017                  vcl_vector<unsigned>& x);
00018 
00019 #endif // mmn_solve_h_