approx for float comparison

Author: matbesancon

test/runtests.jl

@@ -26,7 +26,7 @@ w = [
 ]
 match = maximum_weight_matching(g, CbcSolver(), w)
 @test match.mate[1] == 3
-@test match.weight == 3
+@test match.weight ≈ 3
 
 g = CompleteBipartiteGraph(2,2)
 w = zeros(4,4)
@@ -35,7 +35,7 @@ w[1,4] = 1.
 w[2,3] = 2.
 w[2,4] = 11.
 match = maximum_weight_maximal_matching(g, CbcSolver(), w)
-@test match.weight == 21
+@test match.weight ≈ 21
 @test match.mate[1] == 3
 @test match.mate[3] == 1
 @test match.mate[2] == 4
@@ -48,7 +48,7 @@ w[1,4] = 0.5
 w[2,3] = 11
 w[2,4] = 1
 match = maximum_weight_maximal_matching(g, CbcSolver(), w)
-@test match.weight == 11.5
+@test match.weight ≈ 11.5
 @test match.mate[1] == 4
 @test match.mate[4] == 1
 @test match.mate[2] == 3
@@ -63,7 +63,7 @@ w[2,4] = 1
 w[2,5] = -1
 w[2,6] = -1
 match = maximum_weight_maximal_matching(g,CbcSolver(),w,0)
-@test match.weight == 11.5
+@test match.weight ≈ 11.5
 @test match.mate[1] == 4
 @test match.mate[4] == 1
 @test match.mate[2] == 3
@@ -78,7 +78,7 @@ w[1,6] = 1
 w[1,5] = -1
 
 match = maximum_weight_maximal_matching(g,CbcSolver(),w,0)
-@test match.weight == 12
+@test match.weight ≈ 12
 @test match.mate[1] == 6
 @test match.mate[2] == 5
 @test match.mate[3] == -1
@@ -92,7 +92,7 @@ w[1,2] = 1
 w[3,2] = 1
 w[1,3] = 1
 match = maximum_weight_matching(g,CbcSolver(),w)
-@test match.weight == 1
+@test match.weight ≈ 1
 
 
 g = Graph(4)
@@ -106,7 +106,7 @@ w[1,4] = 3
 w[2,4] = 1
 
 match = maximum_weight_matching(g,CbcSolver(),w)
-@test match.weight == 3
+@test match.weight ≈ 3
 @test match.mate[1] == 4
 @test match.mate[2] == -1
 @test match.mate[3] == -1
@@ -118,7 +118,7 @@ add_edge!(g, 2,3)
 add_edge!(g, 3,1)
 add_edge!(g, 3,4)
 match = maximum_weight_matching(g,CbcSolver())
-@test match.weight == 2
+@test match.weight ≈ 2
 @test match.mate[1] == 2
 @test match.mate[2] == 1
 @test match.mate[3] == 4
@@ -131,7 +131,7 @@ w[1,3] = 1
 w[3,4] = 1
 
 match = maximum_weight_matching(g,CbcSolver(), w)
-@test match.weight == 2
+@test match.weight ≈ 2
 @test match.mate[1] == 2
 @test match.mate[2] == 1
 @test match.mate[3] == 4
@@ -144,7 +144,7 @@ w[1,3] = 5
 w[3,4] = 1
 
 match = maximum_weight_matching(g,CbcSolver(),w)
-@test match.weight == 5
+@test match.weight ≈ 5
 @test match.mate[1] == 3
 @test match.mate[2] == -1
 @test match.mate[3] == 1
@@ -169,7 +169,7 @@ match = minimum_weight_perfect_matching(g, w)
 @test match.mate[2] == 1
 @test match.mate[3] == 4
 @test match.mate[4] == 3
-@test match.weight == 600
+@test match.weight ≈ 600
 
 w = Dict(
         Edge(1, 2) => 500,
@@ -184,7 +184,7 @@ match = minimum_weight_perfect_matching(g, w)
 @test match.mate[2] == 4
 @test match.mate[3] == 1
 @test match.mate[4] == 2
-@test match.weight == 1400
+@test match.weight ≈ 1400
 
 g =CompleteBipartiteGraph(2,2)
 w =Dict{Edge,Float64}()
@@ -198,7 +198,7 @@ match = minimum_weight_perfect_matching(g, w)
 @test match.mate[4] == 1
 @test match.mate[2] == 3
 @test match.mate[3] == 2
-@test match.weight == -11.5
+@test match.weight ≈ -11.5
 
 
 g =CompleteGraph(4)
@@ -214,4 +214,4 @@ match = minimum_weight_perfect_matching(g, w, 50)
 @test match.mate[4] == 1
 @test match.mate[2] == 3
 @test match.mate[3] == 2
-@test match.weight == 11.5
+@test match.weight ≈ 11.5