Skip to content

Mary Tian CS Fun Bipartition Graph#49

Open
Mary-Tian wants to merge 1 commit intoAda-C16:masterfrom
Mary-Tian:master
Open

Mary Tian CS Fun Bipartition Graph#49
Mary-Tian wants to merge 1 commit intoAda-C16:masterfrom
Mary-Tian:master

Conversation

@Mary-Tian
Copy link

No description provided.

Copy link

@kyra-patton kyra-patton left a comment

Choose a reason for hiding this comment

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

🐾🐶 Nice work, Mary. I'm marking this as a yellow since the Big O is not filled out. Let me know what questions you have.

🟡

Comment on lines 8 to 9
Time Complexity: ?
Space Complexity: ?

Choose a reason for hiding this comment

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

⏱🪐 Time and space complexity?

Comment on lines +20 to +23
if dislikes[0]:
start_node = 0
else:
start_node = 1

Choose a reason for hiding this comment

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

Consider the edge case where there are multiple disconnected nodes indexed at the beginning of dislikes

For example: `dislikes = [ [], [], [], [1,2] ]

How might you refactor your code to account for this edge case?

visited.add(start_node)
red.add(start_node)

while len(queue) != 0:

Choose a reason for hiding this comment

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

🐩 Nice BFS approach

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