File tree Expand file tree Collapse file tree 2 files changed +11
-6
lines changed Expand file tree Collapse file tree 2 files changed +11
-6
lines changed Original file line number Diff line number Diff line change 1
1
[deps ]
2
- BlossomV = " 6c721016-9dae-5d90-abf6-67daaccb2332"
3
2
Cbc = " 9961bab8-2fa3-5c5a-9d89-47fab24efd76"
4
3
Graphs = " 86223c79-3864-5bf0-83f7-82e725a168b6"
5
4
Hungarian = " e91730f6-4275-51fb-a7a0-7064cfbd3b39"
6
5
JuMP = " 4076af6c-e467-56ae-b986-b466b2749572"
7
6
LinearAlgebra = " 37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
8
7
LEMONGraphs = " 14b1564f-c77f-4800-9e89-efd961faef7c"
9
8
MathOptInterface = " b8f27783-ece8-5eb3-8dc8-9495eed66fee"
9
+ Pkg = " 44cfe95a-1eb2-52ea-b672-e2afdf69b78f"
10
10
SparseArrays = " 2f01184e-e22b-5df5-ae63-d93ebab69eaf"
11
11
Test = " 8dfed614-e22c-5e08-85e1-65c5234f0b40"
Original file line number Diff line number Diff line change @@ -5,7 +5,11 @@ using Cbc
5
5
using JuMP
6
6
using LinearAlgebra: I
7
7
8
- import BlossomV # to test the extension
8
+ if ! Sys. iswindows ()
9
+ using Pkg
10
+ Pkg. add (" BlossomV" )
11
+ import BlossomV # to test the extension
12
+ end
9
13
10
14
@testset " GraphsMatching" begin
11
15
@@ -261,10 +265,11 @@ import BlossomV # to test the extension
261
265
262
266
263
267
@testset " minimum_weight_perfect_matching" begin
264
- for algorithm in [
265
- BlossomVAlgorithm (),
266
- LEMONMWPMAlgorithm (),
267
- ]
268
+ algos = Any[LEMONMWPMAlgorithm ()]
269
+ if ! Sys. iswindows ()
270
+ push! (algos, BlossomVAlgorithm ())
271
+ end
272
+ for algorithm in algos
268
273
269
274
w = Dict (Edge (1 , 2 ) => 500 )
270
275
g = Graph (2 )
You can’t perform that action at this time.
0 commit comments