Skip to content
New issue

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

Leaves-Mariya #15

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Leaves-Mariya #15

wants to merge 1 commit into from

Conversation

M-Burr
Copy link

@M-Burr M-Burr commented Apr 7, 2020

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think you're going to need to use some stack or queue data structure to sequence how you traverse the graph. Otherwise you're not going in the proper order.

Comment on lines +25 to +34
adjacent_nodes.each do |j|
adjacent_color = puppy_checker(j, pink, blue)
return false if node_color == adjacent_color
if node_color == "pink"
blue << j
else
pink << j
end
end
end

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Shouldn't this section then add the adjacent nodes to j to a queue or stack and continue until the queue or stack is empty?

You're not hitting the nodes in the order they would be encountered in a traversal. Instead you are going through them in order.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants