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

Implement and compare two link-cut structures #36

Open
2 tasks
krzysztof-turowski opened this issue Jul 10, 2024 · 0 comments
Open
2 tasks

Implement and compare two link-cut structures #36

krzysztof-turowski opened this issue Jul 10, 2024 · 0 comments
Labels
algorithms New feature or request documentation Improvements or additions to documentation

Comments

@krzysztof-turowski
Copy link
Owner

Compare the following two link-cut-type structures:

  • Sleator, Tarjan (1983) - A Data Structure for Dynamic Trees
  • Frederickson (1997) - A data structure for dynamically maintaining rooted trees

One can test their usage e.g. in maximum flow algorithms.
@krzysztof-turowski krzysztof-turowski added documentation Improvements or additions to documentation algorithms New feature or request labels Jul 10, 2024
@krzysztof-turowski krzysztof-turowski changed the title Implement and compare on exampe usages two link-cut structures Implement and compare two link-cut structures Jul 10, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithms New feature or request documentation Improvements or additions to documentation
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@krzysztof-turowski