1
56%
master: 56%

Ran 10 Dec 2018 09:11PM UTC

Files 6

Run time 2s

Badge

Embed ▾

Committed 07 Nov 2018 08:19AM UTC coverage: 55.844%. Remained the same

Job # 58.1

Build Type

push

travis-ci

Committed by

matbesancon

Commit Message

Use the Hungarian algorithm for maximum-weight matching (#7)

* First implementation of link to Hungarian.jl.

* More consistent spacing in tests.

* More consistent way of writing tests.

* Allow using the package even if BlossomV is not properly installed (it only works on Linux).

* Add a test suite and make it pass.

* Restore BlossomV importing.

* Correctly pass information to the Hungarian.jl solver (WIP).

* Triple check implementation and tests.

* Implementation should now be correct (Hungarian algorithm is just for bipartite graphs).

* @matbesancon feedback.

* Restore old tests (but avoid checking many times for a bipartite graph).

* Change suggested by @gnimuc.

* Add a common interface behind maximum_weight_maximal_matching

* Deprecate the old interface (based on LP) and add tests.

* Help solve conflicts)

* Typo.

* @matbesancon comment.

* Solve deprecations.

Run Details

86 of 154 relevant lines covered (55.84%)

13.32 hits per line

JuliaGraphs / LightGraphsMatching.jl / 58 / 1
56%
master: 56%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 58.1

JuliaGraphs / LightGraphsMatching.jl / 58 / 1 56% master: 56%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 58.1

JuliaGraphs / LightGraphsMatching.jl / 58 / 1
56%
master: 56%

README BADGES
x