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

Bri L, Leaves #25

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
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
33 changes: 31 additions & 2 deletions lib/possible_bipartition.rb
Original file line number Diff line number Diff line change
@@ -1,4 +1,33 @@

def possible_bipartition(dislikes)
raise NotImplementedError, "possible_bipartition isn't implemented yet"
def possible_bipartition(dislikes)
coloring = {}
dislikes.each_with_index do |dislike_array, this_puppy|
# If the node connected to "this_puppy" doesn't exist in coloring,
# need to search it
if !coloring.key?(this_puppy)
coloring[this_puppy] = true
is_bipartite = dfs(dislikes, this_puppy, dislike_array, coloring)
# If false, return immediately, otherwise check remaining puppies
if is_bipartite == false
return false
end
end
end
return true
end

def dfs(dislikes, this_puppy, dislike_array, coloring)
dislike_array.each do |next_puppy|
# If adding to coloring, make the color the opposite
if !coloring.key?(next_puppy)
coloring[next_puppy] = !coloring[this_puppy]
is_bipartite = dfs(dislikes, next_puppy, dislikes[next_puppy], coloring)
if is_bipartite == false
return false
end
# If the color exists and it's the same, it isn't bipartite
elsif coloring[this_puppy] == coloring[next_puppy]
return false
end
end
end