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

Use lower-complexity graph traversal algorithms #32

Open
juliavdkris opened this issue May 29, 2024 · 0 comments
Open

Use lower-complexity graph traversal algorithms #32

juliavdkris opened this issue May 29, 2024 · 0 comments
Assignees
Labels
enhancement New feature or request priority::low

Comments

@juliavdkris
Copy link
Contributor

As mentioned in #28 (comment), it might be nice to algorithmically optimize the graph traversal in some places.

Right now I don't think we'll have much problems with performance, considering the graphs are pretty small. Marking this issue as low priority for the moment.

I'll look into it At Some Point™, with the remains of my ✨algorithms and data structures✨ knowledge

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request priority::low
Projects
None yet
Development

No branches or pull requests

1 participant