GraphsMatching.jl
GraphsMatching.jl copied to clipboard
JuliaGraphs
Matching algorithms for Graphs.jl
On Julia 1.9.2 with GraphsMatching 0.2.0, the code from the introductory example does not run: ``` julia> using Graphs, GraphsMatching julia> g = complete_graph(3) julia> w = zeros(3,3) julia> w[1,2]...
That's really not a nice behavior :\ ~~the fault seems to be on BlossomV.jl side https://github.com/mlewe/BlossomV.jl/issues/25~~ Ok, in fact, the problem seems to originate from Blossom V itself, this is...
MWE: ```jl minimum_weight_perfect_matching(Graph([Edge(1,2)]), Dict(Edge(1,2)=>2.0)) ERROR: InexactError: trunc(Int32, NaN) Stacktrace: [1] trunc @ ./float.jl:760 [inlined] [2] round @ ./float.jl:359 [inlined] [3] minimum_weight_perfect_matching(g::SimpleGraph{Int64}, w::Dict{Graphs.SimpleGraphs.SimpleEdge{Int64}, Float64}; tmaxscale::Float64) @ GraphsMatching ~/.julia/packages/GraphsMatching/f764e/src/blossomv.jl:40 [4] minimum_weight_perfect_matching(g::SimpleGraph{Int64}, w::Dict{Graphs.SimpleGraphs.SimpleEdge{Int64},...
I would like to use this package's implementation of the Hungarian algorithm, but cannot build it as I cannot build the BlossomV dependency. This appears to be because the link...
Currently, the minimum weight perfect matching (MWPM) algorithm relies on BlossomV.jl, a wrapper around Kolmogorov's BlossomV software, which has a research-only, non-commercial license. I'm wondering if there are any plans...
https://homepages.cwi.nl/~schaefer/ftp/pdf/masters-thesis.pdf section 1.5.1
Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs. - wiki link: https://en.wikipedia.org/wiki/Blossom_algorithm - many simple (not-optimized) implementations of the algorithm from class projects and the...
