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

C15 - Christian Spencer #13

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

Conversation

Crintion
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 Christian, you hit the learning goals here. Well done.

Comment on lines 8 to -11
def possible_bipartition(dislikes):

""" Will return True or False if the given graph
can be bipartitioned without neighboring nodes put
into the same partition.
Time Complexity: ?
Space Complexity: ?
Time Complexity: O(Nodes + Edges)
- Every edge for a dog starting with the first dog and exploring all edges. Edges are only expored once and all nodes must be
colored.
Space Complexity: O(Nodes + Edges)
- The adjacency list has O + E space complexity. Each node and edge requires an array or list space, but it is
not squre when stored in 2 dimensions.
"""
pass

Choose a reason for hiding this comment

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

👍 Interesting solution using numbers (1 and 0) for node colors. Well done.

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