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.

Sign up for GitHub

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

Jump to bottom

Check time bound for graphFromEdges #926

Closed
treeowl opened this issue Feb 1, 2023 · 2 comments
Closed

Check time bound for graphFromEdges #926

treeowl opened this issue Feb 1, 2023 · 2 comments

Comments

@treeowl
Copy link
Contributor

treeowl commented Feb 1, 2023

#923 added the claim that graphFromEdges and graphFromEdges' are $O((V+E)\log V)$. While I haven't done a full analysis, this looks a bit loose to me. Aren't they actually $O(V + E \log V)$?
@treeowl
Copy link
Contributor Author

treeowl commented Feb 1, 2023

@meooow25

@treeowl
Copy link
Contributor Author

treeowl commented Feb 2, 2023

I stand corrected.

@treeowl treeowl closed this as completed Feb 2, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@treeowl