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.

Sign up for GitHub

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

Wrote possible_bipartition method. All tests passing. #7

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

Wrote possible_bipartition method. All tests passing. #7

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 24 additions & 1 deletion lib/possible_bipartition.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,27 @@

def possible_bipartition(dislikes)
raise NotImplementedError, "possible_bipartition isn't implemented yet"
return true if dislikes.length < 2

i = 0
color = "blue"
q = []
nodes_hash = {}

dislikes.each do |dislike|
q.unshift(i) if !nodes_hash[i]
Copy link

Choose a reason for hiding this comment

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

I would use << or push instead of unshift. Just because you put things on the rear of a queue. It's functionally equivalent in this case, because the queue is empty, but it's not treating q like a queue.

nodes_hash[i] = color
while !q.empty?
current = q.pop
dislikes[current].each do |neighbor|
return false if nodes_hash[neighbor] == nodes_hash[current]
if !nodes_hash[neighbor]
nodes_hash[current] == "blue" ? color = "green" : color = "blue"
nodes_hash[neighbor] = color
q.unshift(neighbor)
end
end
end
i += 1
end
return true
end