binary search for apple silicon failure (no stacktrace on crash)

Author: Krastanov

test/runtests.jl

@@ -13,128 +13,6 @@ end
 
 @testset "GraphsMatching" begin
 
-    @testset "maximum_weight_matching_reduction" begin
-        N = Int(1e2)
-        g = complete_graph(N)
-        for i = 1:10
-            w = randn(N, N)
-            w = transpose(w) * w
-            match_sol = maximum_weight_matching(
-                g,
-                optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-                w,
-            )
-            match_red = maximum_weight_matching_reduction(g, w)
-            sol = Edge[]
-            for i = 1:N
-                if (match_sol.mate[i] > 0)
-                    push!(sol, Edge(i, match_sol.mate[i]))
-                end
-            end
-            @test sol == match_red
-        end
-    end
-
-    @testset "maximum_weight_matching" begin
-        g = complete_graph(3)
-        w = [
-            1 2 1
-            1 1 1
-            3 1 1
-        ]
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-            w,
-        )
-        @test match.mate[1] == 3
-        @test match.weight ≈ 3
-
-        g = complete_graph(3)
-        w = zeros(3, 3)
-        w[1, 2] = 1
-        w[3, 2] = 1
-        w[1, 3] = 1
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-            w,
-        )
-        @test match.weight ≈ 1
-
-
-        g = Graph(4)
-        add_edge!(g, 1, 3)
-        add_edge!(g, 1, 4)
-        add_edge!(g, 2, 4)
-
-        w = zeros(4, 4)
-        w[1, 3] = 1
-        w[1, 4] = 3
-        w[2, 4] = 1
-
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-            w,
-        )
-        @test match.weight ≈ 3
-        @test match.mate[1] == 4
-        @test match.mate[2] == -1
-        @test match.mate[3] == -1
-        @test match.mate[4] == 1
-
-        g = Graph(4)
-        add_edge!(g, 1, 2)
-        add_edge!(g, 2, 3)
-        add_edge!(g, 3, 1)
-        add_edge!(g, 3, 4)
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-        )
-        @test match.weight ≈ 2
-        @test match.mate[1] == 2
-        @test match.mate[2] == 1
-        @test match.mate[3] == 4
-        @test match.mate[4] == 3
-
-        w = zeros(4, 4)
-        w[1, 2] = 1
-        w[2, 3] = 1
-        w[1, 3] = 1
-        w[3, 4] = 1
-
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-            w,
-        )
-        @test match.weight ≈ 2
-        @test match.mate[1] == 2
-        @test match.mate[2] == 1
-        @test match.mate[3] == 4
-        @test match.mate[4] == 3
-
-        w = zeros(4, 4)
-        w[1, 2] = 1
-        w[2, 3] = 1
-        w[1, 3] = 5
-        w[3, 4] = 1
-
-        match = maximum_weight_matching(
-            g,
-            optimizer_with_attributes(Cbc.Optimizer, "LogLevel" => 0),
-            w,
-        )
-        @test match.weight ≈ 5
-        @test match.mate[1] == 3
-        @test match.mate[2] == -1
-        @test match.mate[3] == 1
-        @test match.mate[4] == -1
-    end
-
-
     @testset "maximum_weight_maximal_matching" begin
 
         g = complete_bipartite_graph(2, 2)