continuing the binary search

Author: Krastanov

test/runtests.jl

@@ -139,99 +139,4 @@ end
         @test match.weight ≈ 2
 
     end
-
-
-
-    @testset "minimum_weight_perfect_matching" begin
-        algos = Any[LEMONMWPMAlgorithm()]
-        @static if !Sys.iswindows() && Sys.ARCH == :x86_64
-            push!(algos, BlossomVAlgorithm())
-        end
-        for algorithm in algos
-
-        w = Dict(Edge(1, 2) => 500)
-        g = Graph(2)
-        add_edge!(g, 1, 2)
-        match = minimum_weight_perfect_matching(g, w, algorithm)
-        @test match.mate[1] == 2
-
-
-        w = Dict(
-            Edge(1, 2) => 500,
-            Edge(1, 3) => 600,
-            Edge(2, 3) => 700,
-            Edge(3, 4) => 100,
-            Edge(2, 4) => 1000,
-        )
-
-        g = complete_graph(4)
-        match = minimum_weight_perfect_matching(g, w, algorithm)
-        @test match.mate[1] == 2
-        @test match.mate[2] == 1
-        @test match.mate[3] == 4
-        @test match.mate[4] == 3
-        @test match.weight ≈ 600
-
-        w = Dict(
-            Edge(1, 2) => 500,
-            Edge(1, 3) => 400,
-            Edge(2, 3) => 300,
-            Edge(3, 4) => 1000,
-            Edge(2, 4) => 1000,
-        )
-        g = complete_graph(4)
-        match = minimum_weight_perfect_matching(g, w, algorithm)
-        @test match.mate[1] == 3
-        @test match.mate[2] == 4
-        @test match.mate[3] == 1
-        @test match.mate[4] == 2
-        @test match.weight ≈ 1400
-
-        g = complete_bipartite_graph(2, 2)
-        w = Dict{Edge,Float64}()
-        w[Edge(1, 3)] = -10
-        w[Edge(1, 4)] = -0.5
-        w[Edge(2, 3)] = -11
-        w[Edge(2, 4)] = -1
-
-        match = minimum_weight_perfect_matching(g, w, algorithm)
-        @test match.mate[1] == 4
-        @test match.mate[4] == 1
-        @test match.mate[2] == 3
-        @test match.mate[3] == 2
-        @test match.weight ≈ -11.5
-
-
-        g = complete_graph(4)
-        w = Dict{Edge,Float64}()
-        w[Edge(1, 3)] = 10
-        w[Edge(1, 4)] = 0.5
-        w[Edge(2, 3)] = 11
-        w[Edge(2, 4)] = 2
-        w[Edge(1, 2)] = 100
-
-        match = minimum_weight_perfect_matching(g, w, 50, algorithm)
-        @test match.mate[1] == 4
-        @test match.mate[4] == 1
-        @test match.mate[2] == 3
-        @test match.mate[3] == 2
-        @test match.weight ≈ 11.5
-
-        # Issue #5
-        g = Graph(Graph([Edge(1, 2), Edge(2, 3), Edge(4, 1)]))
-        w = Dict(Edge(1, 2) => 2.0, Edge(2, 3) => 2.0, Edge(1, 4) => 2.0)
-        match = minimum_weight_perfect_matching(g, w)
-        @test match.mate == [4, 3, 2, 1]
-        @test match.weight == 4.0
-
-        g = Graph([Edge(1, 2)])
-        wFloat = Dict(Edge(1, 2) => 2.0)
-        wInt = Dict(Edge(1, 2) => 2)
-        matchFloat = minimum_weight_perfect_matching(g, wFloat, algorithm)
-        matchInt = minimum_weight_perfect_matching(g, wInt, algorithm)
-        @test matchFloat.mate == matchInt.mate
-        @test matchFloat.weight == matchInt.weight
-
-        end
-    end
 end