Skip to content

Conversation

@ggrossvi
Copy link

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.

Nice work Gloria, you hit the learning goals here. Well done.

Comment on lines +4 to +13
# does breadth first search(BFS)
def partition_helper(visited, dislikes, starting_dog):
""" Will return True or False if the given graph
can be bipartitioned without neighboring nodes put
into the same partition.
Time Complexity: O(N + E)
Since you will visit each node once, and loop through each of the edges in each node the Big-O of this algorithm is O(N + E) where N is the number of nodes in the graph and E is the number of edges since each node and each edge will be explored.
Space Complexity: O(n)
In the worst-case you will need to add each node to the Queue, so the space complexity is O(N) where N is the number of nodes in the graph.
"""

Choose a reason for hiding this comment

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

👍 Nice implementation of BFS!

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