We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
If I understand correctly, GraphOptim exists as a home for all graph algorithms that require a MILP tool like JuMP.
In which case:
MatchingResult
Also need to be consistent with GraphOptim.min_cost_assignment and BipartiteMatching.jl
GraphOptim.min_cost_assignment
BipartiteMatching.jl
The text was updated successfully, but these errors were encountered:
No branches or pull requests
If I understand correctly, GraphOptim exists as a home for all graph algorithms that require a MILP tool like JuMP.
In which case:
MatchingResult
return type should be synchronized between the two librariesAlso need to be consistent with
GraphOptim.min_cost_assignment
andBipartiteMatching.jl
The text was updated successfully, but these errors were encountered: