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

galantelab / sideRETRO / 363 / 1
90%
master: 97%

Build:
Build:
LAST BUILD BRANCH: HEAD
DEFAULT BRANCH: master
Ran 06 Sep 2020 12:20AM UTC
Files 31
Run time 3s
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

06 Sep 2020 12:13AM UTC coverage: 96.325% (-0.2%) from 96.531%
CK_DEFAULT_TIMEOUT=0

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

Source Files on job 363.1 (CK_DEFAULT_TIMEOUT=0)
  • Tree
  • List 0
  • Changed 2
  • Source Changed 0
  • Coverage Changed 2
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 222
  • Travis Job 363.1
  • dd5a9a7e on github
  • Prev Job for CK_DEFAULT_TIMEOUT=0 on assembly (#362.1)
  • Next Job for CK_DEFAULT_TIMEOUT=0 on assembly (#364.1)
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