fix test matching reduction

Author: victorthouvenot

src/GraphsMatching.jl

@@ -10,7 +10,7 @@ const MOI = MathOptInterface
 import BlossomV # 'using BlossomV'  leads to naming conflicts with JuMP
 using Hungarian
 
-export MatchingResult, maximum_weight_matching, maximum_weight_maximal_matching, minimum_weight_perfect_matching, HungarianAlgorithm, LPAlgorithm
+export MatchingResult, maximum_weight_matching, maximum_weight_matching_reduction, maximum_weight_maximal_matching, minimum_weight_perfect_matching, HungarianAlgorithm, LPAlgorithm
 
 """
     struct MatchingResult{U}

src/maximum_weight_matching.jl

@@ -83,11 +83,11 @@ maximum_weight_matching_reduction(g::Graph, w::Matrix{Real}) -> Array{Edge}
 
 Given a graph `g` and an edgemap `w` containing weights associated to edges,
 returns a matching with the maximum total weight.
-`w` is a dictionary that maps edges i => j to weights.
+`w` is an adjacent matrix that maps edges i => j to weights.
 If no weight parameter is given, all edges will be considered to have weight 1
 
-This algorithm use a reduction based on the minimum_weight_perfect_matching function 
-to find the maximum weight matching.
+This algorithm uses a reduction based on the minimum_weight_perfect_matching function 
+to find the maximum weight matching (see https://homepages.cwi.nl/~schaefer/ftp/pdf/masters-thesis.pdf section 1.5.1).
 
 Return an array of edges contained in the matching.
 """
@@ -122,4 +122,4 @@ function maximum_weight_matching_reduction(g::Graph,
   end
 
   return result
-end
+end