Skip to content

Conversation

@adia-9
Copy link

@adia-9 adia-9 commented Jan 28, 2022

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

Comment on lines +8 to +9
Time Complexity: O(n2)
Space Complexity: O(n)

Choose a reason for hiding this comment

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

The time complexity is O(N+E) because you visit each node once and traverse each edge.

👍 Otherwise nice BFS solution.

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