You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the method graph::DebruijnGraph::max_path, the code only uses the passed solid_path function to check if there is only one valid option, but ignores which one it is when choosing the next node.
If none of the edges are solid paths, it will still choose neighbouring node with the highest score as the next one. If solid_path returns true for only one node, the next node is still chosen solely based on the result of score.
This could probably be fixed by moving the second if block inside the first - unless, of cause, I misunderstood the purpose of the solid_path function.
The text was updated successfully, but these errors were encountered:
In the method
graph::DebruijnGraph::max_path
, the code only uses the passedsolid_path
function to check if there is only one valid option, but ignores which one it is when choosing the next node.If none of the edges are solid paths, it will still choose neighbouring node with the highest score as the next one. If
solid_path
returns true for only one node, the next node is still chosen solely based on the result ofscore
.This could probably be fixed by moving the second
if
block inside the first - unless, of cause, I misunderstood the purpose of thesolid_path
function.The text was updated successfully, but these errors were encountered: