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

Reduce time complexity #1

Open
urastogi885 opened this issue Dec 23, 2020 · 0 comments
Open

Reduce time complexity #1

urastogi885 opened this issue Dec 23, 2020 · 0 comments
Labels
enhancement New feature or request

Comments

@urastogi885
Copy link
Owner

The current implementation takes Θ(|V||E|). I want to reduce it to Θ(|E|). The |V| factor comes due to Θ(|V|) time complexity of deletion. Take a look at the activity diagram and euler_tour.c.
Can we reduce the complexity of the overall implementation to Θ(|E|)?

@urastogi885 urastogi885 added the enhancement New feature or request label Dec 23, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant