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

完善欧拉游览树页面 #4216

Closed
Backl1ght opened this issue Aug 17, 2022 · 1 comment
Closed

完善欧拉游览树页面 #4216

Backl1ght opened this issue Aug 17, 2022 · 1 comment
Labels
Content Request / 内容请求 New feature or request

Comments

@Backl1ght
Copy link
Member

页面英文名

No response

我希望能添加的内容是

根据参考资料完善欧拉游览树面

我了解到的相关参考资料有

  • Robert E. Tarjan - Dynamic trees as search trees via euler tours, applied to the network simplex algorithm.
  • Henzinger et al. - Randomized fully dynamic graph algorithms with polylogarithmic time per operation.
@Backl1ght Backl1ght added the Content Request / 内容请求 New feature or request label Aug 17, 2022
@Backl1ght
Copy link
Member Author

working on it.

@Backl1ght Backl1ght mentioned this issue Aug 23, 2022
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Content Request / 内容请求 New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Backl1ght