You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

lsap.cpp 905 B

12345678910111213141516171819202122232425262728293031323334353637383940414243
  1. /*
  2. Python wrapper
  3. */
  4. #include "hungarian-lsape.hh"
  5. #include "hungarian-lsap.hh"
  6. #include <cstdio>
  7. extern "C" int lsap(double * C, const int nm, long * rho, long * varrho){
  8. double * u = new double[nm];
  9. double * v = new double[nm];
  10. int * rho_int = new int[nm];
  11. int * varrho_int = new int[nm];
  12. hungarianLSAP(C,nm,nm,rho_int,u,v,varrho_int);
  13. //Find a better way to do
  14. for (int i =0;i<nm;i++){
  15. rho[i] = (long)(rho_int[i]);
  16. varrho[i] = (long)(varrho_int[i]);
  17. }
  18. return 0;
  19. }
  20. extern "C" int * lsape(double * C, const int n, const int m, long * rho, long * varrho){
  21. double * u = new double[n];
  22. double * v = new double[m];
  23. int * rho_int = new int[n];
  24. int * varrho_int = new int[m];
  25. hungarianLSAPE(C,n,m,rho_int,varrho_int,u,v);
  26. for (int i =0;i<n;i++)
  27. rho[i] = (long)(rho_int[i]);
  28. for (int i =0;i<m;i++)
  29. varrho[i] = (long)(varrho_int[i]);
  30. return 0;
  31. }

A Python package for graph kernels, graph edit distances and graph pre-image problem.