completed graph #10
completed graph #10
Conversation
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Lacy, this isn't quite working, but you are on the general path to a BFS approach. Take a look at my comments and let me know what questions you have.
| elif current in green: | ||
| green.add(current) |
There was a problem hiding this comment.
If current is in green add it to green? Is that what you wanted to do here?
| red.add(current) | ||
|
|
||
| for neighbor in dislikes[node]: | ||
| if neighbor not in red or green: |
There was a problem hiding this comment.
In these if statements you're going to want to establish that:
If current is in red, that the neighbor is not in red
if the current is in green that the neighbor is not in green
Then if the neighbor is not in green or red add the neighbor to the opposite color of current and then append it to the queue.
If the neighbor is in the same color as current return false.
On an entirely different note, you can't do the or like you have it in if neighbor not in red or green:. it would have to be something like if neighbor not in red and neighbor not in green
2 participants
No description provided.