Status on node to handle formulation modifications/updates by the algorithms #84
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Fix Issue #80 |
Codecov Report
@@ Coverage Diff @@
## master #84 +/- ##
==========================================
+ Coverage 91.41% 91.44% +0.02%
==========================================
Files 33 33
Lines 1468 1473 +5
==========================================
+ Hits 1342 1347 +5
Misses 126 126
Continue to review full report at Codecov.
|
guimarqu
approved these changes
May 22, 2019
src/node.jl
Outdated
| @@ -43,13 +48,14 @@ mutable struct Node <: AbstractNode | |||
| branch::Union{Nothing, Branch} # branch::Id{Constraint} | |||
| algorithm_records::Dict{Type{<:AbstractAlgorithm},AbstractAlgorithmRecord} | |||
| record::NodeRecord | |||
| statuses::FormulationStatus | |||
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
First version status + automatic prepare! calling each algorithm