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

[GSSOC'23] Modify the dfs algorithm without using visited nodes #515

Open

GayathriManeksha opened this issue May 30, 2023 · 0 comments

GayathriManeksha commented May 30, 2023

Use colors to represent nodes such that the need of checking if present in an extra visited data structure can be avoided.

Please assign this to me.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment