Fix for Short Cycle Detection Algorithm #851
Merged
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.
Ticket Reference:
https://dimagi-dev.atlassian.net/browse/HI-572
Will implemented an algorithm to find the shortest cycle in dependency evaluation, but the directional of the graph was implemented backwards
IE: For a calculation
velocity = distance / time
it would create the dependency edge set
distance -> velocity
time -> velocity
rather than
velocity -> time
velocity -> distance
which was making the algorithm mistakenly miss the cycle and error out.
Also ensured that cyclical references are reported specifically as a parse error, which was not unified on the current reporting path. We can end up detecting them in two places.