• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

galantelab / sideRETRO / 363
90%
master: 97%

Build:
Build:
LAST BUILD BRANCH: HEAD
DEFAULT BRANCH: master
Ran 06 Sep 2020 12:20AM UTC
Jobs 1
Files 31
Run time 4s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

pending completion
363

push

travis-ci

thiago-miller
ADD: hungarian.c: Solve Minimum Assignment Problem

Solving the minimum mssignment problem using the hungarian method.
Code adapted from 'libhungarian' by Cyrill Stachniss, 2004.
Make the cost matrix work with double

4561 of 4735 relevant lines covered (96.33%)

1916.29 hits per line

Jobs
ID Job ID Ran Files Coverage
1 363.1 (CK_DEFAULT_TIMEOUT=0) 06 Sep 2020 12:20AM UTC 0
96.33
Travis Job 363.1
Source Files on build 363
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #363
  • dd5a9a7e on github
  • Prev Build on assembly (#362)
  • Next Build on assembly (#364)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc